./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_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 e9c6bf05d102b43fb2b728009d6b55f3314474ef ............................................................................................................................................................................................................................................................................................................... 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_0833_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 e9c6bf05d102b43fb2b728009d6b55f3314474ef ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:05:00,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:00,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:00,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:00,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:00,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:00,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:00,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:00,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:00,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:00,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:00,315 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:00,316 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:00,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:00,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:00,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:00,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:00,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:00,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:00,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:00,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:00,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:00,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:00,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:00,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:00,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:00,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:00,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:00,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:00,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:00,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:00,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:00,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:00,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:00,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:00,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:00,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:05:00,389 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:00,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:00,391 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:00,391 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:00,391 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:00,392 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:00,392 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:00,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:05:00,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:00,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:00,393 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:00,394 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:00,394 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:00,394 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:00,394 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:00,394 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:00,395 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:00,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:00,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:00,395 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:00,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:00,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:00,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:00,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:00,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:00,398 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:05:00,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:00,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:05:00,398 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 -> e9c6bf05d102b43fb2b728009d6b55f3314474ef [2019-01-12 09:05:00,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:00,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:00,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:00,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:00,472 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:00,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:00,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbe4e8d8/02d7bd477af640e687ca50365314fde6/FLAGd519c2c79 [2019-01-12 09:05:01,020 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:05:01,020 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:01,027 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbe4e8d8/02d7bd477af640e687ca50365314fde6/FLAGd519c2c79 [2019-01-12 09:05:01,381 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbe4e8d8/02d7bd477af640e687ca50365314fde6 [2019-01-12 09:05:01,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:05:01,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:05:01,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:01,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:05:01,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:05:01,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231b68e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01, skipping insertion in model container [2019-01-12 09:05:01,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:05:01,439 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:05:01,758 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:01,765 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:05:01,808 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:01,847 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:05:01,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01 WrapperNode [2019-01-12 09:05:01,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:01,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:01,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:05:01,849 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:05:01,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:01,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:05:01,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:05:01,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:05:01,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:01,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:02,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:02,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:02,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... [2019-01-12 09:05:02,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:05:02,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:05:02,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:05:02,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:05:02,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:02,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:05:02,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:05:02,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:05:02,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:05:02,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:05:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:05:02,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:05:02,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:05:02,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:05:02,764 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:05:02,765 INFO L286 CfgBuilder]: Removed 22 assue(true) statements. [2019-01-12 09:05:02,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:02 BoogieIcfgContainer [2019-01-12 09:05:02,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:05:02,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:05:02,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:05:02,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:05:02,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:05:01" (1/3) ... [2019-01-12 09:05:02,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:02, skipping insertion in model container [2019-01-12 09:05:02,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:01" (2/3) ... [2019-01-12 09:05:02,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:02, skipping insertion in model container [2019-01-12 09:05:02,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:02" (3/3) ... [2019-01-12 09:05:02,774 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:02,784 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:05:02,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:05:02,811 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:05:02,842 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:05:02,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:05:02,843 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:05:02,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:05:02,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:05:02,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:05:02,843 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:05:02,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:05:02,844 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:05:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-12 09:05:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:05:02,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:02,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:02,865 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1722268475, now seen corresponding path program 1 times [2019-01-12 09:05:02,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:05:02,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:05:02,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:02,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:02,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:05:03,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:05:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:05:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:03,020 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-01-12 09:05:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:03,042 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2019-01-12 09:05:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:05:03,043 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:05:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:03,053 INFO L225 Difference]: With dead ends: 86 [2019-01-12 09:05:03,054 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 09:05:03,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 09:05:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 09:05:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 09:05:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-01-12 09:05:03,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 11 [2019-01-12 09:05:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:03,091 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-01-12 09:05:03,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:05:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-01-12 09:05:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:05:03,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:03,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:03,092 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1102347550, now seen corresponding path program 1 times [2019-01-12 09:05:03,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:05:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:05:03,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:03,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:03,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:05:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:05:03,276 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:05:03,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:05:03 BoogieIcfgContainer [2019-01-12 09:05:03,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:05:03,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:05:03,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:05:03,362 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:05:03,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:02" (3/4) ... [2019-01-12 09:05:03,368 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:05:03,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:05:03,369 INFO L168 Benchmark]: Toolchain (without parser) took 1982.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -81.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:03,373 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:03,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:03,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:03,378 INFO L168 Benchmark]: Boogie Preprocessor took 56.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:03,379 INFO L168 Benchmark]: RCFGBuilder took 734.93 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:03,380 INFO L168 Benchmark]: TraceAbstraction took 592.79 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:03,382 INFO L168 Benchmark]: Witness Printer took 7.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:03,390 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.16 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 459.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 125.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 734.93 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 592.79 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 153]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 21, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of bitwiseAnd at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 152. Possible FailurePath: [L17-L42] static const double one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+300, twom1000_exp = 9.33263618503218878990e-302, o_threshold_exp = 7.09782712893383973096e+02, u_threshold_exp = -7.45133219101941108420e+02, ln2HI_exp[2] = { 6.93147180369123816490e-01, -6.93147180369123816490e-01, }, ln2LO_exp[2] = { 1.90821492927058770002e-10, -1.90821492927058770002e-10, }, invln2_exp = 1.44269504088896338700e+00, P1_exp = 1.66666666666666019037e-01, P2_exp = -2.77777777770155933842e-03, P3_exp = 6.61375632143793436117e-05, P4_exp = -1.65339022054652515390e-06, P5_exp = 4.13813679705723846039e-08; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L149] double x = -1.0 / 0.0; [L45] double y, hi, lo, c, t; [L46] __int32_t k = 0, xsb; [L47] __uint32_t hx; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L50] ieee_double_shape_type gh_u; [L51] gh_u.value = (x) [L52] EXPR gh_u.parts.msw [L52] (hx) = gh_u.parts.msw [L54] xsb = (hx >> 31) & 1 [L55] hx &= 0x7fffffff VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L57] COND TRUE hx >= 0x40862E42 VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L58] COND FALSE !(hx >= 0x7ff00000) VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L70] COND TRUE x > o_threshold_exp [L71] return huge_exp * huge_exp; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_exp(x); [L152] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L152] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L153] __VERIFIER_error() VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 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=44occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 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-0ed9222-m [2019-01-12 09:05:05,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:05,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:05,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:05,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:05,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:05,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:05,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:05,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:05,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:05,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:05,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:05,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:05,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:05,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:05,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:05,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:05,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:05,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:05,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:05,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:05,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:05,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:05,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:05,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:05,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:05,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:05,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:05,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:05,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:05,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:05,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:05,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:05,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:05,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:05,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:05,706 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:05:05,722 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:05,723 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:05,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:05,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:05,725 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:05,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:05,725 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:05,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:05,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:05:05,726 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:05,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:05,728 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:05,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:05,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:05,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:05,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:05,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:05,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:05,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:05,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:05,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:05,731 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:05:05,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:05,731 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:05:05,731 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:05:05,731 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 -> e9c6bf05d102b43fb2b728009d6b55f3314474ef [2019-01-12 09:05:05,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:05,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:05,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:05,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:05,806 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:05,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:05,870 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e73f34/7c4b5a7002134c8d98fe98dc27b5bf5d/FLAG68e68d9a2 [2019-01-12 09:05:06,302 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:05:06,303 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:06,311 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e73f34/7c4b5a7002134c8d98fe98dc27b5bf5d/FLAG68e68d9a2 [2019-01-12 09:05:06,667 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e3e73f34/7c4b5a7002134c8d98fe98dc27b5bf5d [2019-01-12 09:05:06,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:05:06,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:05:06,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:06,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:05:06,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:05:06,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:06" (1/1) ... [2019-01-12 09:05:06,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12654b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:06, skipping insertion in model container [2019-01-12 09:05:06,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:06" (1/1) ... [2019-01-12 09:05:06,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:05:06,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:05:06,951 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:06,960 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:05:07,015 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:07,049 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:05:07,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07 WrapperNode [2019-01-12 09:05:07,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:07,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:07,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:05:07,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:05:07,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:07,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:05:07,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:05:07,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:05:07,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... [2019-01-12 09:05:07,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:05:07,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:05:07,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:05:07,218 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:05:07,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:07,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:05:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:05:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:05:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:05:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:05:07,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:05:07,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:05:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:05:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:05:07,598 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:07,656 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:07,691 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:08,299 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:08,343 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:19,002 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:19,042 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:19,078 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:05:19,085 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:05:19,085 INFO L286 CfgBuilder]: Removed 22 assue(true) statements. [2019-01-12 09:05:19,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:19 BoogieIcfgContainer [2019-01-12 09:05:19,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:05:19,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:05:19,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:05:19,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:05:19,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:05:06" (1/3) ... [2019-01-12 09:05:19,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f3c793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:19, skipping insertion in model container [2019-01-12 09:05:19,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:07" (2/3) ... [2019-01-12 09:05:19,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f3c793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:19, skipping insertion in model container [2019-01-12 09:05:19,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:19" (3/3) ... [2019-01-12 09:05:19,096 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833_true-unreach-call.c [2019-01-12 09:05:19,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:05:19,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:05:19,129 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:05:19,158 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:05:19,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:05:19,159 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:05:19,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:05:19,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:05:19,160 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:05:19,160 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:05:19,160 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:05:19,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:05:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-01-12 09:05:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:05:19,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:19,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:19,184 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1722268475, now seen corresponding path program 1 times [2019-01-12 09:05:19,196 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:19,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:19,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:19,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:19,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:05:19,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:05:19,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:05:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:19,619 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-01-12 09:05:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:19,638 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2019-01-12 09:05:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:05:19,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:05:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:19,652 INFO L225 Difference]: With dead ends: 86 [2019-01-12 09:05:19,652 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 09:05:19,656 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 [2019-01-12 09:05:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 09:05:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 09:05:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 09:05:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-01-12 09:05:19,695 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 11 [2019-01-12 09:05:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:19,695 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-01-12 09:05:19,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:05:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-01-12 09:05:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:05:19,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:19,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:19,698 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1102347550, now seen corresponding path program 1 times [2019-01-12 09:05:19,700 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:19,700 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) [2019-01-12 09:05:19,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:20,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:20,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:20,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:05:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:05:20,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:05:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:05:20,332 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 5 states. [2019-01-12 09:05:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:20,730 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-01-12 09:05:20,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:05:20,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-12 09:05:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:20,732 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:05:20,732 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:05:20,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:05:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 09:05:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:05:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-12 09:05:20,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2019-01-12 09:05:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:20,741 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-12 09:05:20,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:05:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-12 09:05:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:05:20,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:20,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:20,743 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -691534902, now seen corresponding path program 1 times [2019-01-12 09:05:20,745 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:20,745 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:20,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:20,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:21,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:21,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:21,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:05:21,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:05:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:05:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:05:21,259 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-01-12 09:05:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:21,481 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-12 09:05:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:05:21,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 09:05:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:21,486 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:05:21,488 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:05:21,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:05:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 09:05:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:05:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-12 09:05:21,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2019-01-12 09:05:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:21,506 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-12 09:05:21,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:05:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-12 09:05:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:05:21,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:21,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:21,509 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -129518544, now seen corresponding path program 1 times [2019-01-12 09:05:21,511 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:21,511 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:21,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:21,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:21,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:21,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:05:21,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:05:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:05:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:05:21,746 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-01-12 09:05:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:21,877 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-12 09:05:21,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:05:21,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-12 09:05:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:21,880 INFO L225 Difference]: With dead ends: 31 [2019-01-12 09:05:21,881 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:05:21,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:05:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:05:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 09:05:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:05:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-12 09:05:21,888 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-01-12 09:05:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:21,888 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-12 09:05:21,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:05:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-12 09:05:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:05:21,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:21,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:21,890 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash -72260242, now seen corresponding path program 1 times [2019-01-12 09:05:21,890 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:21,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:22,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:22,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:22,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:22,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:05:22,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:05:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:05:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:05:22,087 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2019-01-12 09:05:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:22,171 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-01-12 09:05:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:05:22,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-12 09:05:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:22,174 INFO L225 Difference]: With dead ends: 24 [2019-01-12 09:05:22,174 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 09:05:22,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:05:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 09:05:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 09:05:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 09:05:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2019-01-12 09:05:22,184 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2019-01-12 09:05:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:22,184 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2019-01-12 09:05:22,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:05:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2019-01-12 09:05:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:05:22,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:22,186 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] [2019-01-12 09:05:22,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1346464765, now seen corresponding path program 1 times [2019-01-12 09:05:22,188 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:05:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:05:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:22,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:05:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:22,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:05:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:22,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 09:05:22,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:05:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:05:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:05:22,726 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 9 states. [2019-01-12 09:05:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:23,009 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-01-12 09:05:23,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:05:23,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-12 09:05:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:23,011 INFO L225 Difference]: With dead ends: 21 [2019-01-12 09:05:23,011 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:05:23,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:05:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:05:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:05:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:05:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:05:23,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-01-12 09:05:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:23,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:05:23,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:05:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:05:23,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:05:23,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:05:23,265 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-01-12 09:05:23,567 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-12 09:05:23,740 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-01-12 09:05:23,769 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 60 64) no Hoare annotation was computed. [2019-01-12 09:05:23,769 INFO L444 ceAbstractionStarter]: At program point L60-2(lines 60 64) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21)))))) [2019-01-12 09:05:23,770 INFO L448 ceAbstractionStarter]: For program point L60-3(lines 58 69) no Hoare annotation was computed. [2019-01-12 09:05:23,770 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 86) no Hoare annotation was computed. [2019-01-12 09:05:23,770 INFO L448 ceAbstractionStarter]: For program point L77-2(lines 77 86) no Hoare annotation was computed. [2019-01-12 09:05:23,770 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 102 106) no Hoare annotation was computed. [2019-01-12 09:05:23,770 INFO L444 ceAbstractionStarter]: At program point L102-2(lines 102 106) the Hoare annotation is: false [2019-01-12 09:05:23,771 INFO L444 ceAbstractionStarter]: At program point L127(lines 44 129) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53))) [2019-01-12 09:05:23,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:05:23,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:05:23,771 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 09:05:23,771 INFO L448 ceAbstractionStarter]: For program point L152-2(lines 152 155) no Hoare annotation was computed. [2019-01-12 09:05:23,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2019-01-12 09:05:23,772 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 71) no Hoare annotation was computed. [2019-01-12 09:05:23,777 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 09:05:23,777 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 99) no Hoare annotation was computed. [2019-01-12 09:05:23,777 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 126) no Hoare annotation was computed. [2019-01-12 09:05:23,777 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 91) no Hoare annotation was computed. [2019-01-12 09:05:23,778 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 114 128) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L121-2(lines 121 126) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 76 91) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 73) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 90) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 74) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L57-2(lines 44 129) no Hoare annotation was computed. [2019-01-12 09:05:23,779 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2019-01-12 09:05:23,780 INFO L444 ceAbstractionStarter]: At program point L49-2(lines 49 53) the Hoare annotation is: (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) [2019-01-12 09:05:23,780 INFO L448 ceAbstractionStarter]: For program point L49-3(lines 49 53) no Hoare annotation was computed. [2019-01-12 09:05:23,780 INFO L444 ceAbstractionStarter]: At program point L140(lines 131 141) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short22| (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res|) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53)) (exists ((v_prenex_24 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24))) (= ((_ extract 63 32) v_prenex_24) ULTIMATE.start___signbit_double_~msw~0)))) [2019-01-12 09:05:23,780 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 112) no Hoare annotation was computed. [2019-01-12 09:05:23,780 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 100 114) no Hoare annotation was computed. [2019-01-12 09:05:23,781 INFO L448 ceAbstractionStarter]: For program point L107-2(lines 107 112) no Hoare annotation was computed. [2019-01-12 09:05:23,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:05:23,785 INFO L451 ceAbstractionStarter]: At program point L157(lines 143 158) the Hoare annotation is: true [2019-01-12 09:05:23,785 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 69) no Hoare annotation was computed. [2019-01-12 09:05:23,785 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 116 120) no Hoare annotation was computed. [2019-01-12 09:05:23,785 INFO L444 ceAbstractionStarter]: At program point L116-2(lines 116 120) the Hoare annotation is: false [2019-01-12 09:05:23,786 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 128) no Hoare annotation was computed. [2019-01-12 09:05:23,786 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-01-12 09:05:23,786 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 09:05:23,786 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short22| (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53))) [2019-01-12 09:05:23,786 INFO L448 ceAbstractionStarter]: For program point L134-3(lines 134 138) no Hoare annotation was computed. [2019-01-12 09:05:23,786 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-01-12 09:05:23,799 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,802 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,803 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,804 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,804 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,806 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,806 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,816 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,817 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,820 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,820 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,821 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,821 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,822 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,825 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,826 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,830 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,831 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,832 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,834 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,834 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,836 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,836 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,841 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,842 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,843 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,843 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,844 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,845 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:23,848 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,849 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,850 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,850 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,851 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,854 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,855 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:23,856 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,856 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:23,857 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,858 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:23,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:05:23 BoogieIcfgContainer [2019-01-12 09:05:23,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:05:23,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:05:23,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:05:23,865 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:05:23,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:19" (3/4) ... [2019-01-12 09:05:23,873 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:05:23,895 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-12 09:05:23,896 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-12 09:05:23,896 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:05:23,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32])) [2019-01-12 09:05:23,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() [2019-01-12 09:05:23,926 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() [2019-01-12 09:05:23,926 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && 0bv32 == \result) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_24 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_24[63:63], v_prenex_24[62:52], v_prenex_24[51:0]) && v_prenex_24[63:32] == msw) [2019-01-12 09:05:23,992 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:05:23,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:05:23,993 INFO L168 Benchmark]: Toolchain (without parser) took 17322.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 954.0 MB in the beginning and 846.1 MB in the end (delta: 108.0 MB). Peak memory consumption was 229.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:23,995 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:23,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.30 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:23,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:23,996 INFO L168 Benchmark]: Boogie Preprocessor took 45.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:23,996 INFO L168 Benchmark]: RCFGBuilder took 11868.47 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: 42.2 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:23,996 INFO L168 Benchmark]: TraceAbstraction took 4777.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.5 MB in the end (delta: 207.9 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:23,999 INFO L168 Benchmark]: Witness Printer took 127.55 ms. Allocated memory is still 1.2 GB. Free memory was 859.5 MB in the beginning and 846.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:24,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 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 377.30 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 936.6 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.82 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. * RCFGBuilder took 11868.47 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: 42.2 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4777.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.5 MB in the end (delta: 207.9 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. * Witness Printer took 127.55 ms. Allocated memory is still 1.2 GB. Free memory was 859.5 MB in the beginning and 846.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,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[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,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_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 153]: 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: 44]: Loop Invariant [2019-01-12 09:05:24,017 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,017 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,023 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,023 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,024 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,025 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,026 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,026 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 49]: Loop Invariant [2019-01-12 09:05:24,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,036 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-01-12 09:05:24,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32])) - InvariantResult [Line: 131]: Loop Invariant [2019-01-12 09:05:24,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,047 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,050 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,050 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,052 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,057 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,058 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,058 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,059 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,061 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,061 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,062 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,062 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2019-01-12 09:05:24,064 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] Derived loop invariant: ((((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && 0bv32 == \result) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_24 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_24[63:63], v_prenex_24[62:52], v_prenex_24[51:0]) && v_prenex_24[63:32] == msw) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant [2019-01-12 09:05:24,071 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,072 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,073 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,073 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,083 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,083 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,086 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2019-01-12 09:05:24,087 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,087 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,088 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,094 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,094 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2019-01-12 09:05:24,094 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,095 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:05:24,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2019-01-12 09:05:24,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: ((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 127 SDslu, 159 SDs, 0 SdLazy, 91 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 348 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 68 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 83 ConstructedInterpolants, 21 QuantifiedInterpolants, 8761 SizeOfPredicates, 22 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...