./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0670_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_0670_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 7437f00c34877da3eeb70986d6a7f4bae4c9669a ......................................................................................................................................................................................................................................................................................................................... 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_0670_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 7437f00c34877da3eeb70986d6a7f4bae4c9669a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:50:37,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:50:37,704 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:50:37,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:50:37,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:50:37,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:50:37,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:50:37,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:50:37,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:50:37,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:50:37,726 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:50:37,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:50:37,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:50:37,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:50:37,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:50:37,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:50:37,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:50:37,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:50:37,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:50:37,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:50:37,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:50:37,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:50:37,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:50:37,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:50:37,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:50:37,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:50:37,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:50:37,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:50:37,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:50:37,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:50:37,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:50:37,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:50:37,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:50:37,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:50:37,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:50:37,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:50:37,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:50:37,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:50:37,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:50:37,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:50:37,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:50:37,774 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:50:37,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:50:37,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:50:37,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:50:37,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:50:37,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:50:37,777 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:50:37,780 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:50:37,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:50:37,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:50:37,780 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:50:37,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:50:37,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:50:37,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:50:37,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:50:37,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:50:37,781 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:50:37,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:50:37,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:50:37,784 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 -> 7437f00c34877da3eeb70986d6a7f4bae4c9669a [2018-12-31 03:50:37,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:50:37,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:50:37,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:50:37,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:50:37,889 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:50:37,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0670_true-unreach-call.c [2018-12-31 03:50:37,954 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba30b9626/bd4bb014b0e14f5e92d466538eb1aef6/FLAG7a3f30153 [2018-12-31 03:50:38,457 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:50:38,458 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0670_true-unreach-call.c [2018-12-31 03:50:38,468 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba30b9626/bd4bb014b0e14f5e92d466538eb1aef6/FLAG7a3f30153 [2018-12-31 03:50:38,762 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba30b9626/bd4bb014b0e14f5e92d466538eb1aef6 [2018-12-31 03:50:38,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:50:38,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:50:38,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:50:38,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:50:38,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:50:38,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:50:38" (1/1) ... [2018-12-31 03:50:38,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601efda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:38, skipping insertion in model container [2018-12-31 03:50:38,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:50:38" (1/1) ... [2018-12-31 03:50:38,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:50:38,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:50:39,180 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:50:39,190 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:50:39,283 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:50:39,318 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:50:39,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39 WrapperNode [2018-12-31 03:50:39,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:50:39,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:50:39,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:50:39,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:50:39,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:50:39,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:50:39,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:50:39,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:50:39,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (1/1) ... [2018-12-31 03:50:39,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:50:39,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:50:39,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:50:39,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:50:39,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (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 [2018-12-31 03:50:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:50:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:50:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:50:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:50:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:50:39,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:50:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:50:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:50:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:50:41,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:50:41,227 INFO L280 CfgBuilder]: Removed 50 assue(true) statements. [2018-12-31 03:50:41,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:50:41 BoogieIcfgContainer [2018-12-31 03:50:41,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:50:41,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:50:41,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:50:41,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:50:41,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:50:38" (1/3) ... [2018-12-31 03:50:41,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3513a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:50:41, skipping insertion in model container [2018-12-31 03:50:41,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:39" (2/3) ... [2018-12-31 03:50:41,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a3513a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:50:41, skipping insertion in model container [2018-12-31 03:50:41,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:50:41" (3/3) ... [2018-12-31 03:50:41,239 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0670_true-unreach-call.c [2018-12-31 03:50:41,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:50:41,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:50:41,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:50:41,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:50:41,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:50:41,321 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:50:41,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:50:41,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:50:41,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:50:41,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:50:41,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:50:41,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:50:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-12-31 03:50:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:50:41,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:41,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:41,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2082511170, now seen corresponding path program 1 times [2018-12-31 03:50:41,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:50:41,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:50:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:50:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:41,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:50:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:50:41,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:41,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:50:41,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:50:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:50:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:50:41,576 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2018-12-31 03:50:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:41,612 INFO L93 Difference]: Finished difference Result 232 states and 388 transitions. [2018-12-31 03:50:41,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:50:41,614 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-31 03:50:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:41,631 INFO L225 Difference]: With dead ends: 232 [2018-12-31 03:50:41,631 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 03:50:41,636 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 [2018-12-31 03:50:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 03:50:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-31 03:50:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 03:50:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2018-12-31 03:50:41,686 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 14 [2018-12-31 03:50:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:41,687 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2018-12-31 03:50:41,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:50:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2018-12-31 03:50:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:50:41,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:41,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:41,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:41,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1907166553, now seen corresponding path program 1 times [2018-12-31 03:50:41,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:50:41,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:50:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:50:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:50:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:50:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:50:42,071 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:50:42,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:50:42 BoogieIcfgContainer [2018-12-31 03:50:42,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:50:42,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:50:42,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:50:42,151 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:50:42,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:50:41" (3/4) ... [2018-12-31 03:50:42,157 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:50:42,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:50:42,158 INFO L168 Benchmark]: Toolchain (without parser) took 3389.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -54.8 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:42,162 INFO L168 Benchmark]: CDTParser took 0.40 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. [2018-12-31 03:50:42,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.00 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:42,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:42,166 INFO L168 Benchmark]: Boogie Preprocessor took 100.64 ms. Allocated memory is still 1.1 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. [2018-12-31 03:50:42,168 INFO L168 Benchmark]: RCFGBuilder took 1649.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:42,169 INFO L168 Benchmark]: TraceAbstraction took 920.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:50:42,171 INFO L168 Benchmark]: Witness Printer took 7.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:50:42,178 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.40 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 547.00 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 157.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.64 ms. Allocated memory is still 1.1 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 1649.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 920.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.31 ms. Allocated memory is still 1.1 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: 262]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 245. 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] [L253] double x = __VERIFIER_nondet_double(); [L254] double y = __VERIFIER_nondet_double(); [L245] return x != x; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] isnan_double(x) || isnan_double(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] [L256] COND TRUE isnan_double(x) || isnan_double(y) [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] [L258] double res = __ieee754_atan2(y, x); [L245] return x != x; 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] [L261] COND TRUE !isnan_double(res) [L262] __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, 119 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 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=119occurred 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 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-2e94e6a [2018-12-31 03:50:44,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:50:44,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:50:44,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:50:44,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:50:44,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:50:44,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:50:44,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:50:44,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:50:44,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:50:44,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:50:44,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:50:44,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:50:44,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:50:44,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:50:44,679 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:50:44,680 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:50:44,682 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:50:44,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:50:44,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:50:44,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:50:44,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:50:44,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:50:44,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:50:44,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:50:44,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:50:44,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:50:44,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:50:44,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:50:44,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:50:44,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:50:44,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:50:44,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:50:44,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:50:44,706 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:50:44,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:50:44,707 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:50:44,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:50:44,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:50:44,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:50:44,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:50:44,724 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:50:44,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:50:44,724 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:50:44,725 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:50:44,726 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:50:44,726 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:50:44,726 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:50:44,726 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:50:44,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:50:44,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:50:44,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:50:44,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:50:44,727 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:50:44,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:50:44,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:50:44,727 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:50:44,728 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:50:44,728 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:50:44,728 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:50:44,728 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:50:44,728 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:50:44,728 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 -> 7437f00c34877da3eeb70986d6a7f4bae4c9669a [2018-12-31 03:50:44,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:50:44,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:50:44,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:50:44,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:50:44,783 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:50:44,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0670_true-unreach-call.c [2018-12-31 03:50:44,851 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb39f9fb/d960c33d0ecf42689b7ebc7f217047a1/FLAGfbbf25874 [2018-12-31 03:50:45,401 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:50:45,402 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0670_true-unreach-call.c [2018-12-31 03:50:45,411 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb39f9fb/d960c33d0ecf42689b7ebc7f217047a1/FLAGfbbf25874 [2018-12-31 03:50:45,707 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb39f9fb/d960c33d0ecf42689b7ebc7f217047a1 [2018-12-31 03:50:45,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:50:45,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:50:45,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:50:45,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:50:45,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:50:45,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:50:45" (1/1) ... [2018-12-31 03:50:45,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b435d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:45, skipping insertion in model container [2018-12-31 03:50:45,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:50:45" (1/1) ... [2018-12-31 03:50:45,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:50:45,777 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:50:46,095 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:50:46,109 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:50:46,184 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:50:46,299 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:50:46,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46 WrapperNode [2018-12-31 03:50:46,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:50:46,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:50:46,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:50:46,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:50:46,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:50:46,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:50:46,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:50:46,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:50:46,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (1/1) ... [2018-12-31 03:50:46,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:50:46,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:50:46,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:50:46,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:50:46,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (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 [2018-12-31 03:50:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:50:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:50:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:50:46,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:50:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:50:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:50:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:50:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:50:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:50:47,021 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:47,157 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:47,272 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:47,784 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:47,821 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:48,852 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:48,871 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:08,856 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:08,886 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:08,931 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:08,980 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:09,881 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:09,914 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:26,456 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:26,489 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:27,151 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:51:27,152 INFO L280 CfgBuilder]: Removed 50 assue(true) statements. [2018-12-31 03:51:27,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:27 BoogieIcfgContainer [2018-12-31 03:51:27,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:51:27,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:51:27,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:51:27,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:51:27,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:50:45" (1/3) ... [2018-12-31 03:51:27,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f65a883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:51:27, skipping insertion in model container [2018-12-31 03:51:27,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:50:46" (2/3) ... [2018-12-31 03:51:27,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f65a883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:51:27, skipping insertion in model container [2018-12-31 03:51:27,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:27" (3/3) ... [2018-12-31 03:51:27,164 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0670_true-unreach-call.c [2018-12-31 03:51:27,176 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:51:27,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:51:27,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:51:27,245 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:51:27,246 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:51:27,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:51:27,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:51:27,247 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:51:27,247 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:51:27,247 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:51:27,248 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:51:27,248 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:51:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-12-31 03:51:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:51:27,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:27,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:51:27,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2082511170, now seen corresponding path program 1 times [2018-12-31 03:51:27,296 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:51:27,297 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) [2018-12-31 03:51:27,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:51:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:27,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:51:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:27,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:51:27,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:51:27,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:51:27,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:51:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:51:27,636 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2018-12-31 03:51:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:51:27,669 INFO L93 Difference]: Finished difference Result 232 states and 388 transitions. [2018-12-31 03:51:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:51:27,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-31 03:51:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:51:27,686 INFO L225 Difference]: With dead ends: 232 [2018-12-31 03:51:27,686 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 03:51:27,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:51:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 03:51:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-31 03:51:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 03:51:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2018-12-31 03:51:27,744 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 14 [2018-12-31 03:51:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:51:27,744 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2018-12-31 03:51:27,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:51:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2018-12-31 03:51:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:51:27,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:27,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:51:27,748 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1907166553, now seen corresponding path program 1 times [2018-12-31 03:51:27,751 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:51:27,751 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) [2018-12-31 03:51:27,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:51:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:28,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:51:28,404 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:51:28,653 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 03:51:29,567 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 03:51:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:29,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:51:30,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:30,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 03:51:30,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:51:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:51:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:51:30,006 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand 9 states. [2018-12-31 03:51:33,461 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-12-31 03:51:37,050 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-12-31 03:51:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:51:51,050 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2018-12-31 03:51:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:51:51,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-31 03:51:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:51:51,065 INFO L225 Difference]: With dead ends: 198 [2018-12-31 03:51:51,066 INFO L226 Difference]: Without dead ends: 193 [2018-12-31 03:51:51,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-12-31 03:51:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-31 03:51:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2018-12-31 03:51:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-31 03:51:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2018-12-31 03:51:51,085 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 16 [2018-12-31 03:51:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:51:51,086 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2018-12-31 03:51:51,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:51:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2018-12-31 03:51:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:51:51,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:51,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:51:51,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2144381910, now seen corresponding path program 1 times [2018-12-31 03:51:51,089 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:51:51,089 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 [2018-12-31 03:51:51,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:51:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:51,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:51:52,047 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 03:51:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:52,433 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:51:52,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:52,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:51:52,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:51:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:51:52,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:51:52,449 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand 8 states. [2018-12-31 03:51:56,287 WARN L181 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-12-31 03:51:59,112 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-12-31 03:52:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:23,639 INFO L93 Difference]: Finished difference Result 230 states and 325 transitions. [2018-12-31 03:52:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:52:23,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-31 03:52:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:23,643 INFO L225 Difference]: With dead ends: 230 [2018-12-31 03:52:23,644 INFO L226 Difference]: Without dead ends: 225 [2018-12-31 03:52:23,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-31 03:52:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-31 03:52:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 128. [2018-12-31 03:52:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 03:52:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2018-12-31 03:52:23,661 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 17 [2018-12-31 03:52:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:23,662 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2018-12-31 03:52:23,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:52:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2018-12-31 03:52:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:52:23,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:23,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:23,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1759093575, now seen corresponding path program 1 times [2018-12-31 03:52:23,668 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:23,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:23,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:23,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:24,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:52:24,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:52:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:52:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:52:24,148 INFO L87 Difference]: Start difference. First operand 128 states and 179 transitions. Second operand 8 states. [2018-12-31 03:52:24,951 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-31 03:52:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:28,181 INFO L93 Difference]: Finished difference Result 219 states and 308 transitions. [2018-12-31 03:52:28,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 03:52:28,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-31 03:52:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:28,185 INFO L225 Difference]: With dead ends: 219 [2018-12-31 03:52:28,186 INFO L226 Difference]: Without dead ends: 186 [2018-12-31 03:52:28,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-31 03:52:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-31 03:52:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2018-12-31 03:52:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-31 03:52:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 184 transitions. [2018-12-31 03:52:28,211 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 184 transitions. Word has length 21 [2018-12-31 03:52:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:28,212 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 184 transitions. [2018-12-31 03:52:28,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:52:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 184 transitions. [2018-12-31 03:52:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:52:28,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:28,218 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] [2018-12-31 03:52:28,219 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1210389367, now seen corresponding path program 1 times [2018-12-31 03:52:28,220 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:28,221 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 [2018-12-31 03:52:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:28,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:28,685 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:28,686 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:28,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-12-31 03:52:28,801 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:28,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-12-31 03:52:28,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:28,857 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 35 treesize of output 27 [2018-12-31 03:52:28,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-12-31 03:52:28,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:28,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:28,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 03:52:28,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-12-31 03:52:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:29,013 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:29,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:29,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:52:29,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:52:29,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:52:29,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:52:29,035 INFO L87 Difference]: Start difference. First operand 132 states and 184 transitions. Second operand 8 states. [2018-12-31 03:52:29,839 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-12-31 03:52:30,503 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-31 03:52:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:32,890 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2018-12-31 03:52:32,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:52:32,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-31 03:52:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:32,894 INFO L225 Difference]: With dead ends: 197 [2018-12-31 03:52:32,894 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 03:52:32,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:52:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 03:52:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-31 03:52:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 03:52:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2018-12-31 03:52:32,917 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 21 [2018-12-31 03:52:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:32,918 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2018-12-31 03:52:32,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:52:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2018-12-31 03:52:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:52:32,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:32,921 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] [2018-12-31 03:52:32,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1508066396, now seen corresponding path program 1 times [2018-12-31 03:52:32,922 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:32,922 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) [2018-12-31 03:52:32,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:33,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:33,431 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:33,433 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:33,436 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:33,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:33,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-12-31 03:52:33,561 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-12-31 03:52:33,606 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-12-31 03:52:33,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,660 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 43 treesize of output 33 [2018-12-31 03:52:33,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-31 03:52:33,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-31 03:52:33,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-31 03:52:33,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:33,790 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. [2018-12-31 03:52:33,790 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:78, output treesize:33 [2018-12-31 03:52:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:34,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:34,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:34,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:52:34,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:52:34,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:52:34,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:34,037 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 7 states. [2018-12-31 03:52:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:34,738 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2018-12-31 03:52:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:52:34,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-31 03:52:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:34,738 INFO L225 Difference]: With dead ends: 115 [2018-12-31 03:52:34,740 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:52:34,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:52:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:52:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:52:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:52:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:52:34,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-31 03:52:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:34,744 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:52:34,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:52:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:52:34,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:52:34,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:52:35,166 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 03:52:37,543 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 03:52:39,851 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-12-31 03:52:41,939 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-31 03:52:41,941 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:41,941 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:41,941 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:41,945 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:41,945 INFO L451 ceAbstractionStarter]: At program point L267(lines 247 268) the Hoare annotation is: true [2018-12-31 03:52:41,945 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-31 03:52:41,945 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2018-12-31 03:52:41,945 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:41,945 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:41,946 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 (exists ((ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~y) |ULTIMATE.start___ieee754_atan2_#res|) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y)))) (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y))) (and .cse0 (exists ((ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (= (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~y) |ULTIMATE.start___ieee754_atan2_#res|))) (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:41,947 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:41,947 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:41,948 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:41,948 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:41,948 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:41,948 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-31 03:52:41,948 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2018-12-31 03:52:41,948 INFO L444 ceAbstractionStarter]: At program point L245(line 245) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) [2018-12-31 03:52:41,948 INFO L444 ceAbstractionStarter]: At program point L245-1(line 245) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) (let ((.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and |ULTIMATE.start_main_#t~short52| (not .cse1)) (and (not |ULTIMATE.start_main_#t~short52|) .cse1)))) [2018-12-31 03:52:41,948 INFO L444 ceAbstractionStarter]: At program point L245-2(line 245) the Hoare annotation is: (let ((.cse0 (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 (exists ((ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~y) |ULTIMATE.start___ieee754_atan2_#res|) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y)))) (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y))) (and .cse0 (exists ((ULTIMATE.start___ieee754_atan2_~y (_ FloatingPoint 11 53)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (= (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~y) |ULTIMATE.start___ieee754_atan2_#res|))) (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2018-12-31 03:52:41,949 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y))) (and .cse0 (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-31 03:52:41,951 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:41,952 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:41,952 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:41,953 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (not (let ((.cse1 (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)))) (fp.eq .cse1 .cse1))) (= ((_ extract 63 32) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~hx~1) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~lx~0))) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_17|)) ULTIMATE.start___ieee754_atan2_~ix~1) (not (let ((.cse2 (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)))) (fp.eq .cse2 .cse2))) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~lx~0))) (not (fp.eq ULTIMATE.start___ieee754_atan2_~x ULTIMATE.start___ieee754_atan2_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and .cse0 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not (fp.eq ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~y))))) [2018-12-31 03:52:41,956 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:41,956 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:41,956 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:41,956 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-31 03:52:41,956 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:41,957 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L256(line 256) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L256-2(lines 256 265) no Hoare annotation was computed. [2018-12-31 03:52:41,958 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-31 03:52:41,959 INFO L448 ceAbstractionStarter]: For program point L256-4(lines 256 265) no Hoare annotation was computed. [2018-12-31 03:52:41,962 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2018-12-31 03:52:41,962 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2018-12-31 03:52:41,963 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-31 03:52:41,963 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:41,963 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:41,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 264) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:41,964 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:41,964 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2018-12-31 03:52:41,964 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2018-12-31 03:52:41,965 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:41,966 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-31 03:52:41,966 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2018-12-31 03:52:41,966 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:52:41,966 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-31 03:52:41,966 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:41,966 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:41,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:41,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,987 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:41,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:41,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:41,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,019 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,024 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,025 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:52:42 BoogieIcfgContainer [2018-12-31 03:52:42,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:52:42,036 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:52:42,036 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:52:42,037 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:52:42,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:27" (3/4) ... [2018-12-31 03:52:42,045 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:52:42,072 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-12-31 03:52:42,073 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-31 03:52:42,109 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x)) [2018-12-31 03:52:42,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) || (\result == 0bv32 && ~fp.eq~DOUBLE(y, y))) && ((aux-isnan_double(x) || isnan_double(y)-aux && !~fp.eq~DOUBLE(x, x)) || (!aux-isnan_double(x) || isnan_double(y)-aux && ~fp.eq~DOUBLE(x, x))) [2018-12-31 03:52:42,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) [2018-12-31 03:52:42,110 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists v_q#valueAsBitvector_17 : bv64 :: (!~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0])) && v_q#valueAsBitvector_17[63:32] == hx) && v_q#valueAsBitvector_17[31:0] == lx)) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == ix && !~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]))) && v_q#valueAsBitvector_17[31:0] == lx)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) || ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) [2018-12-31 03:52:42,111 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result && !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~y, ULTIMATE.start___ieee754_atan2_~y))) && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) [2018-12-31 03:52:42,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result && !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~y, ULTIMATE.start___ieee754_atan2_~y))) && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) [2018-12-31 03:52:42,201 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:52:42,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:52:42,202 INFO L168 Benchmark]: Toolchain (without parser) took 116489.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -54.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,202 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-31 03:52:42,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.30 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,205 INFO L168 Benchmark]: Boogie Preprocessor took 86.12 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,205 INFO L168 Benchmark]: RCFGBuilder took 40671.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,205 INFO L168 Benchmark]: TraceAbstraction took 74881.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,207 INFO L168 Benchmark]: Witness Printer took 164.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:42,211 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.18 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.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.30 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.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.12 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 40671.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74881.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.8 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. * Witness Printer took 164.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,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[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 262]: 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 Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) - 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: 245]: Loop Invariant [2018-12-31 03:52:42,227 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,232 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] Derived loop invariant: (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result && !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~y, ULTIMATE.start___ieee754_atan2_~y))) && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) - 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: 245]: Loop Invariant Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) || (\result == 0bv32 && ~fp.eq~DOUBLE(y, y))) && ((aux-isnan_double(x) || isnan_double(y)-aux && !~fp.eq~DOUBLE(x, x)) || (!aux-isnan_double(x) || isnan_double(y)-aux && ~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2018-12-31 03:52:42,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,245 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:42,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] Derived loop invariant: ((((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists v_q#valueAsBitvector_17 : bv64 :: (!~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0])) && v_q#valueAsBitvector_17[63:32] == hx) && v_q#valueAsBitvector_17[31:0] == lx)) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == ix && !~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]))) && v_q#valueAsBitvector_17[31:0] == lx)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) || ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) - InvariantResult [Line: 142]: Loop Invariant [2018-12-31 03:52:42,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~x,QUANTIFIED] [2018-12-31 03:52:42,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~y,QUANTIFIED] Derived loop invariant: (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result && !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~y, ULTIMATE.start___ieee754_atan2_~y))) && !~fp.eq~DOUBLE(y, y)) && !~fp.eq~DOUBLE(y, y)) || (((~bvadd64(\result, 4294967295bv32) == 0bv32 && (\exists ULTIMATE.start___ieee754_atan2_~y : C_DOUBLE, ULTIMATE.start___ieee754_atan2_~x : C_DOUBLE :: !~fp.eq~DOUBLE(ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_atan2_~x, ULTIMATE.start___ieee754_atan2_~y) == \result)) && !~fp.eq~DOUBLE(x, x)) && !~fp.eq~DOUBLE(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. SAFE Result, 74.7s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 60.9s AutomataDifference, 0.0s DeadEndRemovalTime, 7.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 949 SDtfs, 1329 SDslu, 4377 SDs, 0 SdLazy, 311 SolverSat, 24 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 221 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 29 NumberOfFragments, 282 HoareAnnotationTreeSize, 20 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 46 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 105 ConstructedInterpolants, 20 QuantifiedInterpolants, 15173 SizeOfPredicates, 59 NumberOfNonLiveVariables, 846 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...