./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fa375491f6ee23468a1ede5cb9608fff6035ced ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fa375491f6ee23468a1ede5cb9608fff6035ced ............................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:05:51,530 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:05:51,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:05:51,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:05:51,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:05:51,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:05:51,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:05:51,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:05:51,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:05:51,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:05:51,543 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:05:51,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:05:51,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:05:51,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:05:51,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:05:51,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:05:51,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:05:51,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:05:51,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:05:51,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:05:51,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:05:51,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:05:51,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:05:51,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:05:51,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:05:51,554 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:05:51,555 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:05:51,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:05:51,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:05:51,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:05:51,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:05:51,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:05:51,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:05:51,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:05:51,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:05:51,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:05:51,559 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-22 23:05:51,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:05:51,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:05:51,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:05:51,570 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 23:05:51,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:05:51,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:05:51,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:05:51,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:05:51,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:05:51,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:05:51,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:05:51,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:05:51,572 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 23:05:51,573 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 23:05:51,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:05:51,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:05:51,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 23:05:51,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:05:51,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:05:51,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:05:51,574 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-22 23:05:51,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:05:51,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:05:51,574 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak 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 -> Kojak 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 -> 0fa375491f6ee23468a1ede5cb9608fff6035ced [2018-11-22 23:05:51,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:05:51,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:05:51,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:05:51,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:05:51,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:05:51,608 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c [2018-11-22 23:05:51,645 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/688e73919/7a593a7ba06e4dbb92f4d0c8876ec18f/FLAGbf5e4eb3d [2018-11-22 23:05:52,054 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:05:52,055 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c [2018-11-22 23:05:52,059 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/688e73919/7a593a7ba06e4dbb92f4d0c8876ec18f/FLAGbf5e4eb3d [2018-11-22 23:05:52,068 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/688e73919/7a593a7ba06e4dbb92f4d0c8876ec18f [2018-11-22 23:05:52,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:05:52,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:05:52,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:05:52,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:05:52,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:05:52,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9b2349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52, skipping insertion in model container [2018-11-22 23:05:52,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:05:52,100 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:05:52,225 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:05:52,227 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:05:52,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:05:52,259 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:05:52,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52 WrapperNode [2018-11-22 23:05:52,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:05:52,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:05:52,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:05:52,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:05:52,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:05:52,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:05:52,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:05:52,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:05:52,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:05:52,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:05:52,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:05:52,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:05:52,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-22 23:05:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 23:05:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:05:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 23:05:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:05:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:05:52,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:05:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:05:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:05:52,840 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:05:52,841 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-22 23:05:52,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:05:52 BoogieIcfgContainer [2018-11-22 23:05:52,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:05:52,841 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 23:05:52,841 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 23:05:52,849 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 23:05:52,849 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:05:52" (1/1) ... [2018-11-22 23:05:52,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:05:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:05:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-22 23:05:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-22 23:05:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 23:05:52,885 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:05:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:05:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:05:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:05:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-22 23:05:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-22 23:05:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 23:05:52,965 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:05:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:05:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:05:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:05:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:05:53,049 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E300;havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; VAL [ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4);floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4);floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(floor_double_~j0~0 < 20); VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume floor_double_~j0~0 > 51;BeginParallelComposition{ParallelCodeBlock0: assume 1024 == floor_double_~j0~0;floor_double_#res := ~someBinaryArithmeticDOUBLEoperation(floor_double_~x, floor_double_~x);ParallelCodeBlock1: assume !(1024 == floor_double_~j0~0);floor_double_#res := floor_double_~x;}EndParallelComposition VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, |ULTIMATE.start_floor_double_#res|=1.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] main_#t~ret6 := floor_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0);main_#t~ret7 := isnan_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_isnan_double_~x=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, |ULTIMATE.start_floor_double_#res|=1.0, |ULTIMATE.start_isnan_double_#in~x|=1.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_main_#t~ret7|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == main_#t~ret7;havoc main_#t~ret7; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_isnan_double_~x=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, |ULTIMATE.start_floor_double_#res|=1.0, |ULTIMATE.start_isnan_double_#in~x|=1.0, |ULTIMATE.start_isnan_double_#res|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [ULTIMATE.start_floor_double_~i0~0=1323, ULTIMATE.start_floor_double_~i1~0=8879, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=1.0, ULTIMATE.start_isnan_double_~x=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=1.0, |ULTIMATE.start_floor_double_#res|=1.0, |ULTIMATE.start_isnan_double_#in~x|=1.0, |ULTIMATE.start_isnan_double_#res|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L88] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L89] floor_double_#in~x := main_~x~0; [L89] havoc floor_double_#res; [L89] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L20] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset); [L20] havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L26-L69] assume !(floor_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L47-L69] assume floor_double_~j0~0 > 51; [L48-L51] assume !(1024 == floor_double_~j0~0); [L51] floor_double_#res := floor_double_~x; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L89] main_#t~ret6 := floor_double_#res; [L89] main_~res~0 := main_#t~ret6; [L89] havoc main_#t~ret6; [L92] isnan_double_#in~x := main_~res~0; [L92] havoc isnan_double_#res; [L92] havoc isnan_double_~x; [L80] isnan_double_~x := isnan_double_#in~x; [L80] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L92] main_#t~ret7 := isnan_double_#res; [L92] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_#t~ret7=0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L92-L95] assume 0 == main_#t~ret7; [L92] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L88] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L89] floor_double_#in~x := main_~x~0; [L89] havoc floor_double_#res; [L89] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L20] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset); [L20] havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L26-L69] assume !(floor_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L47-L69] assume floor_double_~j0~0 > 51; [L48-L51] assume !(1024 == floor_double_~j0~0); [L51] floor_double_#res := floor_double_~x; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L89] main_#t~ret6 := floor_double_#res; [L89] main_~res~0 := main_#t~ret6; [L89] havoc main_#t~ret6; [L92] isnan_double_#in~x := main_~res~0; [L92] havoc isnan_double_#res; [L92] havoc isnan_double_~x; [L80] isnan_double_~x := isnan_double_#in~x; [L80] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L92] main_#t~ret7 := isnan_double_#res; [L92] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_#t~ret7=0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L92-L95] assume 0 == main_#t~ret7; [L92] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L88] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L89] floor_double_#in~x := main_~x~0; [L89] havoc floor_double_#res; [L89] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0, floor_double_#t~mem4, floor_double_#t~union5, floor_double_~#iw_u~0, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L20] FCALL call floor_double_~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(floor_double_~x, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] FCALL call floor_double_#t~mem0 := read~int({ base: floor_double_~#ew_u~0!base, offset: 4 + floor_double_~#ew_u~0!offset }, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(floor_double_#t~union1, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] FCALL call floor_double_#t~mem2 := read~int({ base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(floor_double_#t~union3, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] FCALL call ULTIMATE.dealloc(floor_double_~#ew_u~0); [L20] havoc floor_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(floor_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L47] COND TRUE floor_double_~j0~0 > 51 [L48] COND FALSE !(1024 == floor_double_~j0~0) [L51] floor_double_#res := floor_double_~x; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L89] main_#t~ret6 := floor_double_#res; [L89] main_~res~0 := main_#t~ret6; [L89] havoc main_#t~ret6; [L92] isnan_double_#in~x := main_~res~0; [L92] havoc isnan_double_#res; [L92] havoc isnan_double_~x; [L80] isnan_double_~x := isnan_double_#in~x; [L80] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L92] main_#t~ret7 := isnan_double_#res; [L92] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_#t~ret7=0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L92] COND TRUE 0 == main_#t~ret7 [L92] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L88] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L89] floor_double_#in~x := main_~x~0; [L89] havoc floor_double_#res; [L89] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0, floor_double_#t~mem4, floor_double_#t~union5, floor_double_~#iw_u~0, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L20] FCALL call floor_double_~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(floor_double_~x, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] FCALL call floor_double_#t~mem0 := read~int({ base: floor_double_~#ew_u~0!base, offset: 4 + floor_double_~#ew_u~0!offset }, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(floor_double_#t~union1, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] FCALL call floor_double_#t~mem2 := read~int({ base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(floor_double_#t~union3, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] FCALL call ULTIMATE.dealloc(floor_double_~#ew_u~0); [L20] havoc floor_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(floor_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L47] COND TRUE floor_double_~j0~0 > 51 [L48] COND FALSE !(1024 == floor_double_~j0~0) [L51] floor_double_#res := floor_double_~x; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L89] main_#t~ret6 := floor_double_#res; [L89] main_~res~0 := main_#t~ret6; [L89] havoc main_#t~ret6; [L92] isnan_double_#in~x := main_~res~0; [L92] havoc isnan_double_#res; [L92] havoc isnan_double_~x; [L80] isnan_double_~x := isnan_double_#in~x; [L80] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L92] main_#t~ret7 := isnan_double_#res; [L92] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_#t~ret7=0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L92] COND TRUE 0 == main_#t~ret7 [L92] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=1.0, floor_double_#res=1.0, floor_double_~i0~0=1323, floor_double_~i1~0=8879, floor_double_~j0~0=52, floor_double_~x=1.0, isnan_double_#in~x=1.0, isnan_double_#res=0, isnan_double_~x=1.0, main_~res~0=1.0, main_~x~0=1.0, ~huge_floor~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [L88] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L47] COND TRUE ~j0~0 > 51 [L48] COND FALSE !(1024 == ~j0~0) [L51] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L89] ~res~0 := #t~ret6; [L89] havoc #t~ret6; [L80] ~x := #in~x; [L80] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L92] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L92] COND TRUE 0 == #t~ret7 [L92] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [L88] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L47] COND TRUE ~j0~0 > 51 [L48] COND FALSE !(1024 == ~j0~0) [L51] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L89] ~res~0 := #t~ret6; [L89] havoc #t~ret6; [L80] ~x := #in~x; [L80] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L92] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L92] COND TRUE 0 == #t~ret7 [L92] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L93] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L14] static const double huge_floor = 1.0e300; [L88] double x = 0.0 / 0.0; [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] COND FALSE !(j0 < 20) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L47] COND TRUE j0 > 51 [L48] COND FALSE !(j0 == 0x400) [L51] return x; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L89] double res = floor_double(x); [L80] return x != x; [L92] COND TRUE !isnan_double(res) [L93] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-22 23:05:53,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:05:53 ImpRootNode [2018-11-22 23:05:53,100 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 23:05:53,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:05:53,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:05:53,101 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:05:53,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:05:52" (3/4) ... [2018-11-22 23:05:53,104 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:05:53,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:05:53,105 INFO L168 Benchmark]: Toolchain (without parser) took 1034.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -102.6 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,106 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:05:53,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,107 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,108 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,108 INFO L168 Benchmark]: RCFGBuilder took 487.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,109 INFO L168 Benchmark]: CodeCheck took 258.67 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:05:53,109 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:05:53,112 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 34 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 93]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L14] static const double huge_floor = 1.0e300; [L88] double x = 0.0 / 0.0; [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] COND FALSE !(j0 < 20) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L47] COND TRUE j0 > 51 [L48] COND FALSE !(j0 == 0x400) [L51] return x; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L89] double res = floor_double(x); [L80] return x != x; [L92] COND TRUE !isnan_double(res) [L93] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.28 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * CodeCheck took 258.67 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 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. 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.23-aa41828 [2018-11-22 23:05:54,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:05:54,570 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:05:54,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:05:54,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:05:54,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:05:54,579 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:05:54,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:05:54,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:05:54,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:05:54,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:05:54,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:05:54,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:05:54,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:05:54,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:05:54,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:05:54,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:05:54,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:05:54,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:05:54,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:05:54,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:05:54,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:05:54,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:05:54,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:05:54,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:05:54,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:05:54,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:05:54,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:05:54,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:05:54,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:05:54,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:05:54,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:05:54,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:05:54,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:05:54,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:05:54,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:05:54,602 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-22 23:05:54,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:05:54,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:05:54,614 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:05:54,614 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 23:05:54,614 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:05:54,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:05:54,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:05:54,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:05:54,617 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 23:05:54,617 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 23:05:54,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 23:05:54,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 23:05:54,618 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:05:54,619 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 23:05:54,619 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 23:05:54,619 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak 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 -> Kojak 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 -> 0fa375491f6ee23468a1ede5cb9608fff6035ced [2018-11-22 23:05:54,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:05:54,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:05:54,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:05:54,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:05:54,660 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:05:54,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c [2018-11-22 23:05:54,697 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/1323f86d3/f1c1769d5cb24b07a6d174253809ada7/FLAGe056db038 [2018-11-22 23:05:55,115 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:05:55,116 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/sv-benchmarks/c/float-newlib/double_req_bl_1051_true-unreach-call.c [2018-11-22 23:05:55,120 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/1323f86d3/f1c1769d5cb24b07a6d174253809ada7/FLAGe056db038 [2018-11-22 23:05:55,130 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/data/1323f86d3/f1c1769d5cb24b07a6d174253809ada7 [2018-11-22 23:05:55,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:05:55,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:05:55,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:05:55,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:05:55,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:05:55,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2a43b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55, skipping insertion in model container [2018-11-22 23:05:55,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:05:55,160 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:05:55,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:05:55,288 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:05:55,307 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:05:55,324 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:05:55,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55 WrapperNode [2018-11-22 23:05:55,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:05:55,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:05:55,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:05:55,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:05:55,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:05:55,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:05:55,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:05:55,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:05:55,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... [2018-11-22 23:05:55,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:05:55,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:05:55,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:05:55,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:05:55,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:05:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-22 23:05:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:05:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-22 23:05:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:05:55,579 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 23:06:00,777 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:06:00,777 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-22 23:06:00,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:06:00 BoogieIcfgContainer [2018-11-22 23:06:00,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:06:00,778 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 23:06:00,778 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 23:06:00,786 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 23:06:00,786 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:06:00" (1/1) ... [2018-11-22 23:06:00,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:06:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-22 23:06:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-22 23:06:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 23:06:00,822 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:00,863 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:00,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-22 23:06:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-22 23:06:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 23:06:00,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:00,902 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:00,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 20 states and 29 transitions. [2018-11-22 23:06:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-11-22 23:06:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 23:06:01,540 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:01,541 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:01,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2018-11-22 23:06:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-22 23:06:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 23:06:04,574 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:04,575 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:04,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2018-11-22 23:06:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-22 23:06:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-22 23:06:04,726 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:04,726 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:04,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 18 states and 20 transitions. [2018-11-22 23:06:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-22 23:06:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 23:06:04,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:06:04,771 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-22 23:06:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:06:07,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:06:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:06:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:06:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 10 states and 9 transitions. [2018-11-22 23:06:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2018-11-22 23:06:08,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:06:08,871 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 7 iterations. [2018-11-22 23:06:08,880 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-22 23:06:08,937 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-22 23:06:08,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,944 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-22 23:06:08,944 INFO L579 CodeCheckObserver]: Invariant with dag size 6 [2018-11-22 23:06:08,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,945 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,945 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,945 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:08,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:06:08 ImpRootNode [2018-11-22 23:06:08,946 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 23:06:08,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:06:08,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:06:08,947 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:06:08,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:06:00" (3/4) ... [2018-11-22 23:06:08,950 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:06:08,958 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-22 23:06:08,958 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 23:06:08,978 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-11-22 23:06:09,000 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2acc5600-1b13-49fe-a3ec-6b03dda4fc62/bin-2019/ukojak/witness.graphml [2018-11-22 23:06:09,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:06:09,001 INFO L168 Benchmark]: Toolchain (without parser) took 13868.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 949.7 MB in the beginning and 956.0 MB in the end (delta: -6.3 MB). Peak memory consumption was 149.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:06:09,002 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:06:09,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.49 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:06:09,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.39 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:06:09,003 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:06:09,003 INFO L168 Benchmark]: RCFGBuilder took 5404.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:06:09,004 INFO L168 Benchmark]: CodeCheck took 8168.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 141.2 MB). Peak memory consumption was 141.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:06:09,004 INFO L168 Benchmark]: Witness Printer took 54.22 ms. Allocated memory is still 1.2 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:06:09,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 34 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 312 SDslu, 272 SDs, 0 SdLazy, 882 SolverSat, 258 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 462 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 56 ConstructedInterpolants, 7 QuantifiedInterpolants, 3217 SizeOfPredicates, 23 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 93]: 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: 19]: Loop Invariant [2018-11-22 23:06:09,008 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,008 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant [2018-11-22 23:06:09,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 23:06:09,010 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.49 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.39 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5404.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * CodeCheck took 8168.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 141.2 MB). Peak memory consumption was 141.2 MB. Max. memory is 11.5 GB. * Witness Printer took 54.22 ms. Allocated memory is still 1.2 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...