./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0662b_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_0662b_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 427f5a1297639616b7c4f6533641105ea064cfe8 ..................................................................................................................................................................................................................................................................................................................... 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_0662b_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 427f5a1297639616b7c4f6533641105ea064cfe8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:49:13,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:13,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:13,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:13,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:13,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:13,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:13,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:13,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:13,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:13,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:13,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:13,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:13,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:13,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:13,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:13,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:13,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:13,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:13,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:13,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:13,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:13,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:13,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:13,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:13,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:13,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:13,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:13,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:13,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:13,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:13,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:13,406 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:13,406 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:13,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:13,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:13,411 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:49:13,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:13,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:13,440 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:13,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:13,441 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:13,442 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:13,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:13,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:49:13,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:13,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:13,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:13,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:13,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:13,449 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:13,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:13,450 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:13,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:13,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:13,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:13,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:13,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:13,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:13,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:13,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:13,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:13,454 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:49:13,454 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:13,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:49:13,455 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 -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2018-12-31 03:49:13,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:13,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:13,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:13,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:13,547 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:13,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:49:13,601 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111fc6c89/bfaaec9b94fa4affa1be12def56a5f3d/FLAGadc9033ad [2018-12-31 03:49:14,043 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:14,044 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:49:14,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111fc6c89/bfaaec9b94fa4affa1be12def56a5f3d/FLAGadc9033ad [2018-12-31 03:49:14,399 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111fc6c89/bfaaec9b94fa4affa1be12def56a5f3d [2018-12-31 03:49:14,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:14,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:14,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:14,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:14,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:14,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:14,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f47f58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14, skipping insertion in model container [2018-12-31 03:49:14,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:14,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:14,467 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:14,815 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:14,824 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:14,886 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:14,919 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:14,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14 WrapperNode [2018-12-31 03:49:14,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:14,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:14,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:14,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:15,002 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:49:14" (1/1) ... [2018-12-31 03:49:15,036 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:49:14" (1/1) ... [2018-12-31 03:49:15,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:15,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:15,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:15,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:15,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (1/1) ... [2018-12-31 03:49:15,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:15,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:15,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:15,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:15,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (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:49:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:49:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:49:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:49:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:49:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:49:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:16,660 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:49:16,661 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:49:16,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:16 BoogieIcfgContainer [2018-12-31 03:49:16,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:49:16,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:49:16,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:49:16,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:49:16,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:14" (1/3) ... [2018-12-31 03:49:16,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9019c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:16, skipping insertion in model container [2018-12-31 03:49:16,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:14" (2/3) ... [2018-12-31 03:49:16,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9019c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:49:16, skipping insertion in model container [2018-12-31 03:49:16,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:16" (3/3) ... [2018-12-31 03:49:16,672 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:49:16,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:49:16,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:49:16,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:49:16,748 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:49:16,749 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:49:16,750 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:49:16,750 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:49:16,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:49:16,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:49:16,752 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:49:16,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:49:16,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:49:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-12-31 03:49:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:49:16,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:16,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:16,785 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:16,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2018-12-31 03:49:16,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:16,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:49:16,960 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:49:16,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:49:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:49:16,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:49:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:49:16,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:49:16,983 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-12-31 03:49:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:49:17,014 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2018-12-31 03:49:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:49:17,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:49:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:49:17,029 INFO L225 Difference]: With dead ends: 227 [2018-12-31 03:49:17,029 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:49:17,034 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:49:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:49:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-31 03:49:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-31 03:49:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2018-12-31 03:49:17,081 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2018-12-31 03:49:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:49:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2018-12-31 03:49:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:49:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2018-12-31 03:49:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:49:17,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:49:17,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:49:17,083 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:49:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:49:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2018-12-31 03:49:17,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:49:17,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:49:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:17,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:49:17,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:49:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:49:17,438 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:49:17,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:49:17 BoogieIcfgContainer [2018-12-31 03:49:17,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:49:17,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:49:17,511 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:49:17,511 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:49:17,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:49:16" (3/4) ... [2018-12-31 03:49:17,518 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:49:17,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:49:17,519 INFO L168 Benchmark]: Toolchain (without parser) took 3115.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 948.7 MB in the beginning and 987.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:17,522 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:49:17,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.83 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 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:49:17,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 205.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:17,525 INFO L168 Benchmark]: Boogie Preprocessor took 94.16 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:49:17,526 INFO L168 Benchmark]: RCFGBuilder took 1440.92 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.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:17,528 INFO L168 Benchmark]: TraceAbstraction took 846.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:49:17,529 INFO L168 Benchmark]: Witness Printer took 7.49 ms. Allocated memory is still 1.1 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:49:17,535 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 514.83 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 205.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.16 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 1440.92 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.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 846.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 987.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.49 ms. Allocated memory is still 1.1 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 260]: 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 259. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = 0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y < 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -pi_o_2 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] [L260] __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, 115 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 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=115occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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:49:19,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:49:19,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:49:19,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:49:19,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:49:19,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:49:19,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:49:19,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:49:19,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:49:19,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:49:19,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:49:19,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:49:19,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:49:19,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:49:19,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:49:19,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:49:19,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:49:19,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:49:19,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:49:19,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:49:19,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:49:19,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:49:19,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:49:19,913 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:49:19,913 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:49:19,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:49:19,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:49:19,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:49:19,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:49:19,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:49:19,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:49:19,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:49:19,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:49:19,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:49:19,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:49:19,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:49:19,922 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:49:19,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:49:19,945 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:49:19,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:49:19,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:49:19,948 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:49:19,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:49:19,948 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:49:19,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:49:19,949 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:49:19,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:49:19,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:49:19,952 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:49:19,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:49:19,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:49:19,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:49:19,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:49:19,955 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:49:19,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:49:19,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:49:19,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:49:19,956 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:49:19,957 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:49:19,957 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:49:19,957 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:49:19,957 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:49:19,957 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 -> 427f5a1297639616b7c4f6533641105ea064cfe8 [2018-12-31 03:49:20,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:49:20,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:49:20,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:49:20,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:49:20,061 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:49:20,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:49:20,120 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025f60fb8/75d0ec57774a4fc7be9f3040c3dad337/FLAG514f2389a [2018-12-31 03:49:20,613 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:49:20,614 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:49:20,624 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025f60fb8/75d0ec57774a4fc7be9f3040c3dad337/FLAG514f2389a [2018-12-31 03:49:20,926 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025f60fb8/75d0ec57774a4fc7be9f3040c3dad337 [2018-12-31 03:49:20,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:49:20,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:49:20,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:20,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:49:20,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:49:20,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:20" (1/1) ... [2018-12-31 03:49:20,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e727def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:20, skipping insertion in model container [2018-12-31 03:49:20,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:49:20" (1/1) ... [2018-12-31 03:49:20,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:49:21,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:49:21,285 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:21,308 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:49:21,398 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:49:21,523 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:49:21,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21 WrapperNode [2018-12-31 03:49:21,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:49:21,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:21,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:49:21,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:49:21,538 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:49:21" (1/1) ... [2018-12-31 03:49:21,574 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:49:21" (1/1) ... [2018-12-31 03:49:21,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:49:21,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:49:21,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:49:21,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:49:21,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (1/1) ... [2018-12-31 03:49:21,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:49:21,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:49:21,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:49:21,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:49:21,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (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:49:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:49:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:49:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:49:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:49:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:49:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:49:21,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:49:21,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:49:21,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:49:22,391 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:22,464 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:22,801 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:23,207 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:23,256 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:23,913 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:23,968 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:44,746 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:44,768 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:44,824 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:44,895 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:45,634 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:49:45,679 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:01,721 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:01,753 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:50:02,424 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:50:02,424 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:50:02,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:50:02 BoogieIcfgContainer [2018-12-31 03:50:02,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:50:02,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:50:02,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:50:02,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:50:02,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:49:20" (1/3) ... [2018-12-31 03:50:02,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b393648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:50:02, skipping insertion in model container [2018-12-31 03:50:02,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:49:21" (2/3) ... [2018-12-31 03:50:02,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b393648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:50:02, skipping insertion in model container [2018-12-31 03:50:02,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:50:02" (3/3) ... [2018-12-31 03:50:02,437 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662b_true-unreach-call.c [2018-12-31 03:50:02,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:50:02,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:50:02,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:50:02,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:50:02,518 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:50:02,518 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:50:02,518 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:50:02,518 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:50:02,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:50:02,519 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:50:02,520 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:50:02,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:50:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-12-31 03:50:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:50:02,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:02,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:02,553 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2018-12-31 03:50:02,567 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:02,568 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:50:02,580 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:50:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:02,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:02,892 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:02,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:02,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:50:02,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:50:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:50:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:50:02,941 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-12-31 03:50:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:03,003 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2018-12-31 03:50:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:50:03,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:50:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:03,034 INFO L225 Difference]: With dead ends: 227 [2018-12-31 03:50:03,036 INFO L226 Difference]: Without dead ends: 111 [2018-12-31 03:50:03,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-31 03:50:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-31 03:50:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-31 03:50:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2018-12-31 03:50:03,112 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2018-12-31 03:50:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:03,112 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2018-12-31 03:50:03,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:50:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2018-12-31 03:50:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:50:03,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:03,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:03,114 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2018-12-31 03:50:03,118 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:03,118 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:03,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:04,031 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,033 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,052 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,059 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 73 treesize of output 98 [2018-12-31 03:50:04,277 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-31 03:50:04,335 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,351 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:50:04,398 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-12-31 03:50:04,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 59 treesize of output 59 [2018-12-31 03:50:04,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:04,572 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 46 treesize of output 36 [2018-12-31 03:50:04,659 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 32 treesize of output 28 [2018-12-31 03:50:04,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:04,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:04,752 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 32 treesize of output 24 [2018-12-31 03:50:04,803 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 24 treesize of output 9 [2018-12-31 03:50:04,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:04,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:04,872 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:50:04,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-31 03:50:04,920 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:97, output treesize:37 [2018-12-31 03:50:07,140 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:07,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:07,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:07,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:50:07,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2018-12-31 03:50:07,163 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 8 states. [2018-12-31 03:50:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:12,176 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2018-12-31 03:50:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:12,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-31 03:50:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:12,563 INFO L225 Difference]: With dead ends: 167 [2018-12-31 03:50:12,563 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 03:50:12,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2018-12-31 03:50:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 03:50:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-31 03:50:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-31 03:50:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2018-12-31 03:50:12,591 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 13 [2018-12-31 03:50:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:12,591 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2018-12-31 03:50:12,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2018-12-31 03:50:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:50:12,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:12,598 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:12,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2018-12-31 03:50:12,599 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:12,602 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:50:12,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:12,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:13,618 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:14,032 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:14,304 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:14,309 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:14,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:50:14,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:14,332 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand 6 states. [2018-12-31 03:50:15,182 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:15,393 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:16,445 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:50:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:17,985 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2018-12-31 03:50:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:17,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-31 03:50:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:17,988 INFO L225 Difference]: With dead ends: 72 [2018-12-31 03:50:17,988 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 03:50:17,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:50:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 03:50:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-31 03:50:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-31 03:50:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2018-12-31 03:50:18,009 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 18 [2018-12-31 03:50:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:18,009 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2018-12-31 03:50:18,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2018-12-31 03:50:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:50:18,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:18,011 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] [2018-12-31 03:50:18,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:18,013 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2018-12-31 03:50:18,013 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:18,013 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:50:18,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:18,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:19,027 WARN L181 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:19,333 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:19,604 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-31 03:50:19,608 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:19,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:19,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:19,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:50:19,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:50:19,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:50:19,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:50:19,627 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand 6 states. [2018-12-31 03:50:20,166 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:20,841 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:21,219 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:50:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:22,533 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2018-12-31 03:50:22,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:50:22,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-31 03:50:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:22,535 INFO L225 Difference]: With dead ends: 70 [2018-12-31 03:50:22,535 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 03:50:22,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:50:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 03:50:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-31 03:50:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 03:50:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-12-31 03:50:22,553 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 20 [2018-12-31 03:50:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:22,553 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-12-31 03:50:22,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:50:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-12-31 03:50:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:50:22,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:22,554 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:50:22,555 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:22,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:22,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2018-12-31 03:50:22,556 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:22,556 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:50:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:22,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:23,237 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:23,238 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:23,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:23,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:50:23,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:23,256 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 8 states. [2018-12-31 03:50:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:27,386 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-12-31 03:50:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:50:27,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-31 03:50:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:27,389 INFO L225 Difference]: With dead ends: 68 [2018-12-31 03:50:27,389 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 03:50:27,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-31 03:50:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 03:50:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-31 03:50:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 03:50:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-12-31 03:50:27,410 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 21 [2018-12-31 03:50:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:27,411 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2018-12-31 03:50:27,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-12-31 03:50:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 03:50:27,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:27,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:27,412 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2018-12-31 03:50:27,413 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:27,413 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:27,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:27,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:28,527 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2018-12-31 03:50:28,556 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:28,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:28,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:28,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:50:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:28,576 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 8 states. [2018-12-31 03:50:29,399 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-31 03:50:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:32,216 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-12-31 03:50:32,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:32,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-31 03:50:32,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:32,220 INFO L225 Difference]: With dead ends: 68 [2018-12-31 03:50:32,220 INFO L226 Difference]: Without dead ends: 61 [2018-12-31 03:50:32,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:50:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-31 03:50:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-31 03:50:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 03:50:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-12-31 03:50:32,240 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 24 [2018-12-31 03:50:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:32,241 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-12-31 03:50:32,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-12-31 03:50:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 03:50:32,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:32,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:32,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2912589, now seen corresponding path program 1 times [2018-12-31 03:50:32,244 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:32,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:32,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:33,598 WARN L181 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:50:34,197 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 03:50:34,222 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 66 treesize of output 60 [2018-12-31 03:50:34,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 60 treesize of output 55 [2018-12-31 03:50:34,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-31 03:50:34,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:34,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:34,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:34,787 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:50:34,787 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:106, output treesize:67 [2018-12-31 03:50:35,026 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-31 03:50:35,332 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-31 03:50:35,803 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-31 03:50:35,813 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:35,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:35,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:35,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:50:35,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:50:35,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:50:35,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:50:35,830 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2018-12-31 03:50:38,067 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:50:38,617 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-31 03:50:39,209 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-31 03:50:39,688 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-31 03:50:40,494 WARN L181 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-31 03:50:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:40,677 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-31 03:50:40,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:50:40,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-31 03:50:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:40,679 INFO L225 Difference]: With dead ends: 73 [2018-12-31 03:50:40,680 INFO L226 Difference]: Without dead ends: 61 [2018-12-31 03:50:40,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:50:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-31 03:50:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-31 03:50:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-31 03:50:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-12-31 03:50:40,700 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2018-12-31 03:50:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:40,700 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-12-31 03:50:40,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:50:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-12-31 03:50:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 03:50:40,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:40,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:40,705 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 282554315, now seen corresponding path program 1 times [2018-12-31 03:50:40,707 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:50:40,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:42,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:42,626 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 54 treesize of output 48 [2018-12-31 03:50:42,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 24 [2018-12-31 03:50:42,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 03:50:42,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 03:50:42,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-31 03:50:42,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:37 [2018-12-31 03:50:43,611 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:43,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:43,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:43,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 03:50:43,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 03:50:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 03:50:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:50:43,640 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 11 states. [2018-12-31 03:50:48,888 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-31 03:50:49,889 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-31 03:50:51,897 WARN L181 SmtUtils]: Spent 881.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-31 03:50:54,148 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 56 [2018-12-31 03:50:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:50:55,559 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-12-31 03:50:55,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 03:50:55,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-12-31 03:50:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:50:55,580 INFO L225 Difference]: With dead ends: 74 [2018-12-31 03:50:55,580 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 03:50:55,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-12-31 03:50:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 03:50:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-31 03:50:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 03:50:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-31 03:50:55,620 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-31 03:50:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:50:55,620 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-31 03:50:55,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 03:50:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-31 03:50:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 03:50:55,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:50:55,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:50:55,625 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:50:55,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:50:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1439805872, now seen corresponding path program 1 times [2018-12-31 03:50:55,626 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:50:55,627 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 03:50:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:50:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:50:56,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:50:57,307 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-31 03:50:57,982 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 66 treesize of output 60 [2018-12-31 03:50:57,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 60 treesize of output 55 [2018-12-31 03:50:58,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-31 03:50:58,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:50:58,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:58,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:50:58,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-31 03:50:58,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:133, output treesize:94 [2018-12-31 03:50:59,901 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:59,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:50:59,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:50:59,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-31 03:50:59,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 03:50:59,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 03:50:59,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-12-31 03:50:59,936 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 18 states. [2018-12-31 03:51:02,622 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-31 03:51:03,137 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-31 03:51:06,513 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-31 03:51:07,486 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-31 03:51:10,716 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-31 03:51:20,633 WARN L181 SmtUtils]: Spent 791.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-12-31 03:51:32,647 WARN L181 SmtUtils]: Spent 5.24 s on a formula simplification that was a NOOP. DAG size: 90 [2018-12-31 03:51:43,015 WARN L181 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 101 [2018-12-31 03:51:55,648 WARN L181 SmtUtils]: Spent 5.78 s on a formula simplification that was a NOOP. DAG size: 106 [2018-12-31 03:52:11,559 WARN L181 SmtUtils]: Spent 10.61 s on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-12-31 03:52:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:12,179 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-31 03:52:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 03:52:12,196 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-12-31 03:52:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:12,197 INFO L225 Difference]: With dead ends: 57 [2018-12-31 03:52:12,197 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 03:52:12,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=290, Invalid=758, Unknown=8, NotChecked=0, Total=1056 [2018-12-31 03:52:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 03:52:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-31 03:52:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 03:52:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2018-12-31 03:52:12,237 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 42 [2018-12-31 03:52:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:12,237 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2018-12-31 03:52:12,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 03:52:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2018-12-31 03:52:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 03:52:12,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:12,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:12,241 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2043823236, now seen corresponding path program 1 times [2018-12-31 03:52:12,242 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:13,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:14,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:14,030 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:14,032 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 33 treesize of output 43 [2018-12-31 03:52:14,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:14,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:14,103 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 24 treesize of output 32 [2018-12-31 03:52:14,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:14,127 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 24 treesize of output 18 [2018-12-31 03:52:14,131 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:14,132 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 18 treesize of output 9 [2018-12-31 03:52:14,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:14,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:14,142 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:14,156 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:14,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-31 03:52:14,218 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:14,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:14,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:52:14,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:52:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:52:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:52:14,246 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2018-12-31 03:52:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:14,486 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2018-12-31 03:52:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:52:14,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-12-31 03:52:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:14,489 INFO L225 Difference]: With dead ends: 44 [2018-12-31 03:52:14,489 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:52:14,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:52:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:52:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:52:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:52:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:52:14,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-12-31 03:52:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:14,493 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:52:14,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:52:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:52:14,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:52:14,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:52:14,785 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 03:52:15,916 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2018-12-31 03:52:16,157 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2018-12-31 03:52:19,636 WARN L181 SmtUtils]: Spent 3.48 s on a formula simplification. DAG size of input: 141 DAG size of output: 57 [2018-12-31 03:52:19,640 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:19,640 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:19,640 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:19,640 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-31 03:52:19,642 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:19,643 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:19,644 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-31 03:52:19,645 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) .cse0) |ULTIMATE.start___ieee754_atan2_#res|) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~hy~0) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~ly~0))) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_q#valueAsBitvector_16|) ULTIMATE.start___ieee754_atan2_~hx~1))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (_ +zero 11 53)) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 .cse0) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_17|)) ULTIMATE.start___ieee754_atan2_~iy~0) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~ly~0))))) [2018-12-31 03:52:19,645 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:19,645 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:19,645 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:19,645 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:19,645 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)) ~pi_lo_atan2~0) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53))) [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:19,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2018-12-31 03:52:19,647 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:52:19,648 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-12-31 03:52:19,649 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:19,649 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)) ~pi_lo_atan2~0) (exists ((|v_q#valueAsBitvector_30| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) |v_q#valueAsBitvector_30|))) (and (= .cse0 ULTIMATE.start___ieee754_atan2_~lx~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_30|) ((_ extract 62 52) |v_q#valueAsBitvector_30|) ((_ extract 51 0) |v_q#valueAsBitvector_30|))) (= (bvand (_ bv2147483647 32) .cse0) ULTIMATE.start___ieee754_atan2_~ix~1)))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53))) [2018-12-31 03:52:19,649 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:19,649 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:19,649 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:19,649 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2018-12-31 03:52:19,650 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:19,651 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:19,652 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:52:19,653 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-31 03:52:19,653 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2018-12-31 03:52:19,653 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3061616997868382943.0 25000000000000000000000000000000000.0)))) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (_ +zero 11 53)) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= (fp.add roundNearestTiesToEven ~pi_o_2~0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) ULTIMATE.start___ieee754_atan2_~z~1) (= .cse0 ~pi_lo_atan2~0) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (exists ((ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr ULTIMATE.start___ieee754_atan2_~hy~0 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_19|) (_ bv30 32))))) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (= (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hy~0) ULTIMATE.start___ieee754_atan2_~iy~0) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~hy~0) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)) (= ((_ extract 31 0) |v_q#valueAsBitvector_17|) ULTIMATE.start___ieee754_atan2_~ly~0))) (= (_ +zero 11 53) ULTIMATE.start_main_~x~0) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_18|))) (and (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|)) (_ +zero 11 53)) (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr .cse1 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ULTIMATE.start___ieee754_atan2_~hx~1 (_ bv30 32))))) (= (bvand (_ bv2147483647 32) .cse1) ULTIMATE.start___ieee754_atan2_~iy~0)))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))))) [2018-12-31 03:52:19,653 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:19,654 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:19,654 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:19,655 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2018-12-31 03:52:19,655 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L451 ceAbstractionStarter]: At program point L265(lines 244 266) the Hoare annotation is: true [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:19,656 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:19,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,675 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,678 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,682 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,684 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,684 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,685 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,686 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:19,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,708 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,708 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,708 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,709 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,709 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,709 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:19,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2018-12-31 03:52:19,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,718 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,730 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,731 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,731 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,737 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:19,743 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,743 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,745 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,746 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,764 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,773 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,773 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,773 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,782 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:52:19 BoogieIcfgContainer [2018-12-31 03:52:19,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:52:19,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:52:19,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:52:19,790 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:52:19,791 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:02" (3/4) ... [2018-12-31 03:52:19,795 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:52:19,815 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-31 03:52:19,816 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-31 03:52:19,855 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && (\exists v_q#valueAsBitvector_30 : bv64 :: (v_q#valueAsBitvector_30[63:32] == lx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_30[63:63], v_q#valueAsBitvector_30[62:52], v_q#valueAsBitvector_30[51:0])) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_30[63:32]) == ix)) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) [2018-12-31 03:52:19,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && v_q#valueAsBitvector_16[63:32] == hx)) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix)) && ~Pluszero~LONGDOUBLE() == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly) [2018-12-31 03:52:19,861 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((aux-switch (m) { case 0: return z; case 1: { __uint32_t zh; do { ieee_double_shape_type gh_u; gh_u.value = (z); (zh) = gh_u.parts.msw; } while (0); do { ieee_double_shape_type sh_u; sh_u.value = (z); sh_u.parts.msw = (zh ^ 0x80000000); (z) = sh_u.value; } while (0); } return z; case 2: return pi - (z - pi_lo_atan2); default: return (z - pi_lo_atan2) - pi; }-aux && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000))) == z) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && ~bvand32(2147483647bv32, hy) == iy) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && ~Pluszero~LONGDOUBLE() == x) && (\exists ULTIMATE.start___ieee754_atan2_~hx~1 : bv32, v_q#valueAsBitvector_18 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]), ~Pluszero~LONGDOUBLE()) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_18[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hx~1, 30bv32)))) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_18[63:32]) == iy)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0])) [2018-12-31 03:52:19,944 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:52:19,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:52:19,945 INFO L168 Benchmark]: Toolchain (without parser) took 179015.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 952.7 MB in the beginning and 944.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 293.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:19,946 INFO L168 Benchmark]: CDTParser took 0.17 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:19,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:19,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:52:19,947 INFO L168 Benchmark]: Boogie Preprocessor took 74.33 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:19,948 INFO L168 Benchmark]: RCFGBuilder took 40700.20 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:19,948 INFO L168 Benchmark]: TraceAbstraction took 137363.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.0 GB in the beginning and 952.8 MB in the end (delta: 89.7 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:19,948 INFO L168 Benchmark]: Witness Printer took 154.04 ms. Allocated memory is still 1.3 GB. Free memory was 952.8 MB in the beginning and 944.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:19,954 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.17 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 592.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.33 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 40700.20 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: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 137363.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.0 GB in the beginning and 952.8 MB in the end (delta: 89.7 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. * Witness Printer took 154.04 ms. Allocated memory is still 1.3 GB. Free memory was 952.8 MB in the beginning and 944.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: 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 [2018-12-31 03:52:19,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant [2018-12-31 03:52:19,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,974 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2018-12-31 03:52:19,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:19,992 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,992 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,992 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,992 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:19,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hx~1,QUANTIFIED] [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:19,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] Derived loop invariant: ((((((((((((aux-switch (m) { case 0: return z; case 1: { __uint32_t zh; do { ieee_double_shape_type gh_u; gh_u.value = (z); (zh) = gh_u.parts.msw; } while (0); do { ieee_double_shape_type sh_u; sh_u.value = (z); sh_u.parts.msw = (zh ^ 0x80000000); (z) = sh_u.value; } while (0); } return z; case 2: return pi - (z - pi_lo_atan2); default: return (z - pi_lo_atan2) - pi; }-aux && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix)) && ~Pluszero~LONGDOUBLE() == x) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi_o_2, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000))) == z) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && ~bvand32(2147483647bv32, hy) == iy) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && ~Pluszero~LONGDOUBLE() == x) && (\exists ULTIMATE.start___ieee754_atan2_~hx~1 : bv32, v_q#valueAsBitvector_18 : bv64 :: (~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0]), ~Pluszero~LONGDOUBLE()) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_q#valueAsBitvector_18[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hx~1, 30bv32)))) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_18[63:32]) == iy)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0])) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2018-12-31 03:52:20,002 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,003 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,004 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,010 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_30,QUANTIFIED] [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,011 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:20,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] Derived loop invariant: ((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 3061616997868382943/25000000000000000000000000000000000) == pi_lo_atan2 && (\exists v_q#valueAsBitvector_30 : bv64 :: (v_q#valueAsBitvector_30[63:32] == lx && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_30[63:63], v_q#valueAsBitvector_30[62:52], v_q#valueAsBitvector_30[51:0])) && ~bvand32(2147483647bv32, v_q#valueAsBitvector_30[63:32]) == ix)) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 142]: Loop Invariant [2018-12-31 03:52:20,015 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,015 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,015 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,017 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,021 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,021 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:20,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] Derived loop invariant: ((((((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && (\exists v_q#valueAsBitvector_17 : bv64 :: (v_q#valueAsBitvector_17[63:32] == hy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly)) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && v_q#valueAsBitvector_16[63:32] == hx)) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix)) && ~Pluszero~LONGDOUBLE() == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_17 : bv64 :: (~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]), ~Pluszero~LONGDOUBLE())) && v_q#valueAsBitvector_17[31:0] == ly) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. SAFE Result, 137.1s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 109.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 642 SDtfs, 1821 SDslu, 1161 SDs, 0 SdLazy, 382 SolverSat, 38 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 43.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 23 NumberOfFragments, 351 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 450 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 251 ConstructedInterpolants, 81 QuantifiedInterpolants, 136561 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1650 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...