./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0680a_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_0680a_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 baa80d60694a6a02d32fddddbbe44c204edcedd1 .................................................................................................................................................................................................................................................................................................................... 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_0680a_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 baa80d60694a6a02d32fddddbbe44c204edcedd1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:47,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:01:47,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:01:47,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:01:47,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:01:47,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:01:47,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:01:47,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:01:47,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:01:47,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:01:47,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:01:47,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:01:47,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:01:47,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:01:47,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:01:47,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:01:47,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:01:47,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:01:47,766 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:01:47,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:01:47,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:01:47,770 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:01:47,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:01:47,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:01:47,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:01:47,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:01:47,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:01:47,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:01:47,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:01:47,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:01:47,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:01:47,779 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:01:47,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:01:47,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:01:47,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:01:47,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:01:47,782 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:47,816 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:01:47,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:01:47,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:01:47,821 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:01:47,821 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:01:47,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:01:47,822 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:01:47,822 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:01:47,822 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:01:47,822 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:01:47,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:01:47,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:01:47,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:01:47,824 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:01:47,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:01:47,824 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:01:47,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:01:47,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:01:47,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:01:47,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:01:47,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:01:47,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:01:47,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:01:47,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:01:47,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:01:47,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:01:47,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:01:47,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:01:47,829 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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-01-12 09:01:47,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:01:47,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:01:47,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:01:47,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:01:47,923 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:01:47,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:01:47,977 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b418c4a5e/114b745bf6664dbe8898687f9f3658d9/FLAG1af8fca9c [2019-01-12 09:01:48,448 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:01:48,449 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:01:48,459 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b418c4a5e/114b745bf6664dbe8898687f9f3658d9/FLAG1af8fca9c [2019-01-12 09:01:48,766 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b418c4a5e/114b745bf6664dbe8898687f9f3658d9 [2019-01-12 09:01:48,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:01:48,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:01:48,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:48,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:01:48,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:01:48,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:48" (1/1) ... [2019-01-12 09:01:48,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73be08f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:48, skipping insertion in model container [2019-01-12 09:01:48,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:48" (1/1) ... [2019-01-12 09:01:48,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:01:48,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:01:49,153 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:49,162 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:01:49,229 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:49,258 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:01:49,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:49 WrapperNode [2019-01-12 09:01:49,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:49,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:49,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:01:49,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:01:49,337 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:49" (1/1) ... [2019-01-12 09:01:49,363 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:49" (1/1) ... [2019-01-12 09:01:49,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:49,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:01:49,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:01:49,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:01:49,437 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:49" (1/1) ... [2019-01-12 09:01:49,438 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:49" (1/1) ... [2019-01-12 09:01:49,447 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:49" (1/1) ... [2019-01-12 09:01:49,447 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:49" (1/1) ... [2019-01-12 09:01:49,475 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:49" (1/1) ... [2019-01-12 09:01:49,487 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:49" (1/1) ... [2019-01-12 09:01:49,492 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:49" (1/1) ... [2019-01-12 09:01:49,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:01:49,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:01:49,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:01:49,501 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:01:49,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:49" (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:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:01:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:01:49,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:01:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:01:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:01:49,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:01:51,017 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:01:51,018 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:01:51,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:01:51 BoogieIcfgContainer [2019-01-12 09:01:51,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:01:51,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:01:51,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:01:51,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:01:51,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:01:48" (1/3) ... [2019-01-12 09:01:51,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae92f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:01:51, skipping insertion in model container [2019-01-12 09:01:51,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:49" (2/3) ... [2019-01-12 09:01:51,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae92f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:01:51, skipping insertion in model container [2019-01-12 09:01:51,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:01:51" (3/3) ... [2019-01-12 09:01:51,029 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:01:51,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:01:51,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:01:51,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:01:51,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:01:51,090 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:01:51,091 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:01:51,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:01:51,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:01:51,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:01:51,091 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:01:51,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:01:51,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:01:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:01:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:01:51,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:51,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:51,118 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:51,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:01:51,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:01:51,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:01:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:51,271 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:51,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:51,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:01:51,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:01:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:01:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:01:51,288 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:01:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:51,317 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:01:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:01:51,318 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:01:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:51,329 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:01:51,330 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:01:51,333 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:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:01:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:01:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:01:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:01:51,372 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:01:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:51,372 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:01:51,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:01:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:01:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:01:51,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:51,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:51,374 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:51,375 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:01:51,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:01:51,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:01:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:01:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:01:51,693 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:01:51,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:01:51 BoogieIcfgContainer [2019-01-12 09:01:51,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:01:51,757 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:01:51,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:01:51,757 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:01:51,758 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:51" (3/4) ... [2019-01-12 09:01:51,762 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:01:51,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:01:51,763 INFO L168 Benchmark]: Toolchain (without parser) took 2993.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -57.2 MB). Peak memory consumption was 65.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:51,767 INFO L168 Benchmark]: CDTParser took 0.21 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:51,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:51,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:51,769 INFO L168 Benchmark]: Boogie Preprocessor took 75.14 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:01:51,770 INFO L168 Benchmark]: RCFGBuilder took 1518.45 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:51,772 INFO L168 Benchmark]: TraceAbstraction took 735.83 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:51,773 INFO L168 Benchmark]: Witness Printer took 5.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:01:51,780 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.21 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 487.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 165.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.14 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 1518.45 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 735.83 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 257]: 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 256. 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] [L254] double res = __ieee754_atan2(y, x); [L256] 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] [L257] __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.6s 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:53,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:01:53,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:01:53,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:01:53,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:01:53,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:01:53,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:01:53,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:01:53,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:01:54,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:01:54,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:01:54,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:01:54,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:01:54,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:01:54,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:01:54,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:01:54,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:01:54,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:01:54,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:01:54,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:01:54,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:01:54,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:01:54,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:01:54,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:01:54,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:01:54,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:01:54,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:01:54,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:01:54,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:01:54,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:01:54,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:01:54,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:01:54,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:01:54,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:01:54,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:01:54,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:01:54,028 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:54,043 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:01:54,043 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:01:54,044 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:01:54,045 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:01:54,045 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:01:54,045 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:01:54,045 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:01:54,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:01:54,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:01:54,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:01:54,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:01:54,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:01:54,046 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:01:54,047 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:01:54,048 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:01:54,048 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:01:54,048 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:01:54,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:01:54,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:01:54,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:01:54,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:01:54,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:01:54,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:01:54,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:01:54,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:01:54,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:01:54,051 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:01:54,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:01:54,052 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:01:54,052 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:01:54,052 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 -> baa80d60694a6a02d32fddddbbe44c204edcedd1 [2019-01-12 09:01:54,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:01:54,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:01:54,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:01:54,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:01:54,107 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:01:54,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:01:54,162 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a0c8992/7c992561af3b40b9b7292e4a33354b74/FLAGdb2c663ce [2019-01-12 09:01:54,593 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:01:54,594 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:01:54,604 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a0c8992/7c992561af3b40b9b7292e4a33354b74/FLAGdb2c663ce [2019-01-12 09:01:54,925 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a0c8992/7c992561af3b40b9b7292e4a33354b74 [2019-01-12 09:01:54,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:01:54,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:01:54,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:54,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:01:54,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:01:54,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:54" (1/1) ... [2019-01-12 09:01:54,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700d6f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:54, skipping insertion in model container [2019-01-12 09:01:54,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:54" (1/1) ... [2019-01-12 09:01:54,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:01:54,995 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:01:55,326 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:55,339 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:01:55,411 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:55,517 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:01:55,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:55 WrapperNode [2019-01-12 09:01:55,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:55,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:55,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:01:55,519 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:01:55,528 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:55" (1/1) ... [2019-01-12 09:01:55,563 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:55" (1/1) ... [2019-01-12 09:01:55,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:55,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:01:55,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:01:55,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:01:55,641 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:55" (1/1) ... [2019-01-12 09:01:55,641 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:55" (1/1) ... [2019-01-12 09:01:55,662 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:55" (1/1) ... [2019-01-12 09:01:55,663 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:55" (1/1) ... [2019-01-12 09:01:55,694 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:55" (1/1) ... [2019-01-12 09:01:55,705 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:55" (1/1) ... [2019-01-12 09:01:55,710 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:55" (1/1) ... [2019-01-12 09:01:55,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:01:55,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:01:55,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:01:55,718 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:01:55,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:55" (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:55,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:01:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:01:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:01:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:01:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:01:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:01:55,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:01:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:01:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:01:56,309 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:56,597 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,288 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,327 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,473 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,528 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,585 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,632 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:59,667 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,269 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,313 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,341 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,365 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:33,730 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:33,847 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:37,052 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:02:37,052 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:02:37,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:37 BoogieIcfgContainer [2019-01-12 09:02:37,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:02:37,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:02:37,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:02:37,061 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:02:37,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:01:54" (1/3) ... [2019-01-12 09:02:37,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543f2c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:37, skipping insertion in model container [2019-01-12 09:02:37,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:55" (2/3) ... [2019-01-12 09:02:37,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543f2c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:37, skipping insertion in model container [2019-01-12 09:02:37,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:37" (3/3) ... [2019-01-12 09:02:37,066 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680a_true-unreach-call.c [2019-01-12 09:02:37,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:02:37,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:02:37,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:02:37,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:02:37,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:02:37,129 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:02:37,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:02:37,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:02:37,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:02:37,130 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:02:37,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:02:37,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:02:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:02:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:02:37,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:37,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:37,160 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:02:37,173 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:37,174 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:37,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:37,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:37,559 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:37,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:37,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:37,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:02:37,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:02:37,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:02:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:02:37,595 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:02:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:37,632 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:02:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:02:37,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:02:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:37,649 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:02:37,649 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:02:37,653 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:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:02:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:02:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:02:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:02:37,701 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:02:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:37,702 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:02:37,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:02:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:02:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:02:37,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:37,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:37,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:02:37,706 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:37,706 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:37,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:38,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:38,425 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:38,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:38,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:38,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:38,451 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 7 states. [2019-01-12 09:02:39,041 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-12 09:02:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:42,369 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2019-01-12 09:02:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:02:42,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-12 09:02:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:42,374 INFO L225 Difference]: With dead ends: 176 [2019-01-12 09:02:42,374 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 09:02:42,375 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:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 09:02:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2019-01-12 09:02:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2019-01-12 09:02:42,387 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2019-01-12 09:02:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:42,387 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2019-01-12 09:02:42,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:02:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2019-01-12 09:02:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:02:42,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:42,390 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:42,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash 808768545, now seen corresponding path program 1 times [2019-01-12 09:02:42,392 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:42,392 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:42,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:42,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:42,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:42,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:42,906 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:42,907 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:42,913 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:42,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:02:42,946 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2019-01-12 09:02:42,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:42,997 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 28 treesize of output 22 [2019-01-12 09:02:42,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:43,120 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 29 treesize of output 23 [2019-01-12 09:02:43,226 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:02:43,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:02:43,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-12 09:02:43,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:43,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:02:43,385 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:43,424 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:43,425 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:65, output treesize:29 [2019-01-12 09:02:43,616 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:43,616 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:43,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:43,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:02:43,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:02:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:02:43,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:02:43,634 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 5 states. [2019-01-12 09:02:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:45,616 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-01-12 09:02:46,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:02:46,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-12 09:02:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:46,007 INFO L225 Difference]: With dead ends: 125 [2019-01-12 09:02:46,007 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:46,008 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:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-01-12 09:02:46,022 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2019-01-12 09:02:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:46,023 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-01-12 09:02:46,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:02:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2019-01-12 09:02:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:02:46,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:46,025 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:46,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2019-01-12 09:02:46,027 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:46,027 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:02:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:02:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:46,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:46,656 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-12 09:02:46,687 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:46,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:46,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:46,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:46,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:46,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:46,710 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 7 states. [2019-01-12 09:02:47,063 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-12 09:02:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:49,579 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-01-12 09:02:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:02:49,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-12 09:02:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:49,583 INFO L225 Difference]: With dead ends: 130 [2019-01-12 09:02:49,586 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:49,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:02:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-01-12 09:02:49,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2019-01-12 09:02:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:49,605 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-01-12 09:02:49,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:02:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-01-12 09:02:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:02:49,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:49,607 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:49,607 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2019-01-12 09:02:49,608 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:49,608 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:49,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:49,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:50,427 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:50,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:50,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:02:50,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:02:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:02:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:02:50,442 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 8 states. [2019-01-12 09:02:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:53,211 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-01-12 09:02:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:02:53,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-01-12 09:02:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:53,216 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:02:53,220 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:53,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:02:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-01-12 09:02:53,285 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2019-01-12 09:02:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:53,286 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-01-12 09:02:53,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:02:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-01-12 09:02:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:02:53,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:53,286 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:53,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:53,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2019-01-12 09:02:53,296 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:53,297 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:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:53,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:54,053 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:02:54,927 WARN L181 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:02:54,937 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:54,937 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:54,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:54,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:02:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:02:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:02:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:02:54,952 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 5 states. [2019-01-12 09:02:55,321 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:02:56,069 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:02:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:58,696 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-01-12 09:02:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:02:58,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-12 09:02:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:58,699 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:02:58,699 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:58,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-01-12 09:02:58,720 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2019-01-12 09:02:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:58,721 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-01-12 09:02:58,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:02:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-01-12 09:02:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:02:58,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:58,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:58,723 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:58,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1240434960, now seen corresponding path program 1 times [2019-01-12 09:02:58,724 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:58,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:02:58,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:59,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:02:59,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:59,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:59,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:59,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:59,420 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 7 states. [2019-01-12 09:03:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:00,083 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2019-01-12 09:03:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:03:00,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 09:03:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:00,084 INFO L225 Difference]: With dead ends: 71 [2019-01-12 09:03:00,084 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:03:00,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:03:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:03:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:03:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:03:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:03:00,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-12 09:03:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:00,086 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:03:00,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:03:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:03:00,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:03:00,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:03:00,283 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:03:00,465 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-01-12 09:03:01,380 WARN L181 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-01-12 09:03:01,385 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:03:01,385 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:03:01,385 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:03:01,386 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:03:01,387 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:03:01,388 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse2 (fp.neg (_ +zero 11 53))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((v_prenex_61 (_ BitVec 64)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_61)) (.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_18|))) (and (= (fp.neg (_ +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 31 0) |v_q#valueAsBitvector_18|)) (= ((_ extract 63 32) v_prenex_61) .cse1) (= ULTIMATE.start___ieee754_atan2_~ly~0 .cse0) (= (bvand (_ bv2147483647 32) .cse1) ULTIMATE.start___ieee754_atan2_~iy~0)))) (= .cse2 ULTIMATE.start___ieee754_atan2_~y) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse2 ULTIMATE.start___ieee754_atan2_~x) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) .cse3)) (exists ((|v_q#valueAsBitvector_21| (_ BitVec 64)) (|v_q#valueAsBitvector_20| (_ BitVec 64))) (let ((.cse4 (fp.neg (_ +zero 11 53)))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_20|) ((_ extract 62 52) |v_q#valueAsBitvector_20|) ((_ extract 51 0) |v_q#valueAsBitvector_20|)) .cse4) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|)) .cse4) (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_21|) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_20|) (_ bv30 32)))))))) (= ~tiny_atan2~0 .cse3) (exists ((v_prenex_61 (_ BitVec 64)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse6 ((_ extract 63 32) |v_q#valueAsBitvector_18|)) (.cse5 ((_ extract 31 0) v_prenex_61))) (and (= (fp.neg (_ +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|))) (= .cse5 ((_ extract 31 0) |v_q#valueAsBitvector_18|)) (= ((_ extract 63 32) v_prenex_61) .cse6) (= ULTIMATE.start___ieee754_atan2_~hy~0 .cse6) (= ULTIMATE.start___ieee754_atan2_~ly~0 .cse5)))) (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|))))))) [2019-01-12 09:03:01,388 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:03:01,388 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:03:01,388 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:03:01,388 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:03:01,389 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2019-01-12 09:03:01,389 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:03:01,390 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:03:01,392 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~y) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse0 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:03:01,393 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:03:01,393 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:03:01,394 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,395 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 259) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L257(line 257) no Hoare annotation was computed. [2019-01-12 09:03:01,396 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L451 ceAbstractionStarter]: At program point L260(lines 244 261) the Hoare annotation is: true [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:03:01,397 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:03:01,398 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:03:01,398 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:03:01,398 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:03:01,399 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:03:01,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2019-01-12 09:03:01,400 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:03:01,400 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:03:01,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,441 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,441 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,442 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,444 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:03:01 BoogieIcfgContainer [2019-01-12 09:03:01,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:03:01,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:03:01,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:03:01,452 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:03:01,452 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:37" (3/4) ... [2019-01-12 09:03:01,456 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:03:01,478 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:03:01,479 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-12 09:03:01,480 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:03:01,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~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:03:01,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((~fp.neg~DOUBLE(~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_q#valueAsBitvector_18[31:0]) && v_prenex_61[63:32] == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_18[63:32]) == iy) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && (\exists v_q#valueAsBitvector_21 : bv64, v_q#valueAsBitvector_20 : bv64 :: (~fp~LONGDOUBLE(v_q#valueAsBitvector_20[63:63], v_q#valueAsBitvector_20[62:52], v_q#valueAsBitvector_20[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_21[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_20[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((~fp.neg~DOUBLE(~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_q#valueAsBitvector_18[31:0]) && v_prenex_61[63:32] == v_q#valueAsBitvector_18[63:32]) && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0])) && (\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])) [2019-01-12 09:03:01,593 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:03:01,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:03:01,595 INFO L168 Benchmark]: Toolchain (without parser) took 66664.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 100.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,596 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:03:01,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,597 INFO L168 Benchmark]: Boogie Preprocessor took 93.38 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:03:01,598 INFO L168 Benchmark]: RCFGBuilder took 41335.98 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: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,598 INFO L168 Benchmark]: TraceAbstraction took 24396.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,601 INFO L168 Benchmark]: Witness Printer took 142.69 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.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:01,605 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.22 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 585.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.38 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 41335.98 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: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24396.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * Witness Printer took 142.69 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.4 MB). Peak memory consumption was 14.4 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_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_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_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,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_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_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_prenex_61,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_19,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_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_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,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_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,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_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_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_prenex_61,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_19,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 257]: 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:03:01,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~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:03:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,638 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,638 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,639 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:03:01,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~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: 142]: Loop Invariant [2019-01-12 09:03:01,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,644 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,645 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,645 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,645 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,646 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,649 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,650 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,664 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_20,QUANTIFIED] [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:03:01,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:03:01,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:03:01,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:03:01,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] Derived loop invariant: ((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((~fp.neg~DOUBLE(~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_q#valueAsBitvector_18[31:0]) && v_prenex_61[63:32] == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_18[63:32]) == iy) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == y) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && (\exists v_q#valueAsBitvector_21 : bv64, v_q#valueAsBitvector_20 : bv64 :: (~fp~LONGDOUBLE(v_q#valueAsBitvector_20[63:63], v_q#valueAsBitvector_20[62:52], v_q#valueAsBitvector_20[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_21[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_20[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((~fp.neg~DOUBLE(~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_q#valueAsBitvector_18[31:0]) && v_prenex_61[63:32] == v_q#valueAsBitvector_18[63:32]) && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0])) && (\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])) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. SAFE Result, 24.2s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 560 SDtfs, 1141 SDslu, 724 SDs, 0 SdLazy, 174 SolverSat, 30 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 5.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, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 229 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 106 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 109 ConstructedInterpolants, 44 QuantifiedInterpolants, 26799 SizeOfPredicates, 46 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...