./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1092a_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_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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 8be2489bdcd97218605067fa4593696f9050abdf ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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 8be2489bdcd97218605067fa4593696f9050abdf ..................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:15:11,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:15:11,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:15:11,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:15:11,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:15:11,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:15:11,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:15:11,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:15:11,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:15:11,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:15:11,300 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:15:11,300 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:15:11,301 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:15:11,302 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:15:11,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:15:11,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:15:11,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:15:11,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:15:11,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:15:11,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:15:11,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:15:11,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:15:11,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:15:11,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:15:11,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:15:11,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:15:11,312 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:15:11,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:15:11,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:15:11,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:15:11,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:15:11,314 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:15:11,314 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:15:11,314 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:15:11,315 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:15:11,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:15:11,316 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 01:15:11,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:15:11,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:15:11,326 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:15:11,326 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:15:11,327 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:15:11,327 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:15:11,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:15:11,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:15:11,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:15:11,328 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:15:11,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:15:11,329 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:15:11,329 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:15:11,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:15:11,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:15:11,329 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:15:11,329 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:15:11,329 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:15:11,330 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:15:11,330 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 01:15:11,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:15:11,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:15:11,330 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_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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 -> 8be2489bdcd97218605067fa4593696f9050abdf [2018-11-23 01:15:11,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:15:11,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:15:11,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:15:11,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:15:11,365 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:15:11,365 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c [2018-11-23 01:15:11,408 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/631f1b269/e6fca9b615b843dc91be3879986294c3/FLAG9ea040ce9 [2018-11-23 01:15:11,762 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:15:11,762 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c [2018-11-23 01:15:11,767 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/631f1b269/e6fca9b615b843dc91be3879986294c3/FLAG9ea040ce9 [2018-11-23 01:15:11,779 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/631f1b269/e6fca9b615b843dc91be3879986294c3 [2018-11-23 01:15:11,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:15:11,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:15:11,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:11,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:15:11,786 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:15:11,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:11,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4cd105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11, skipping insertion in model container [2018-11-23 01:15:11,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:11,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:15:11,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:15:11,945 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:11,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:15:11,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:11,982 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:15:11,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11 WrapperNode [2018-11-23 01:15:11,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:11,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:11,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:15:11,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:15:11,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:11,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:12,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:15:12,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:15:12,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:15:12,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... [2018-11-23 01:15:12,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:15:12,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:15:12,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:15:12,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:15:12,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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-23 01:15:12,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:15:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:15:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:15:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:15:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:15:12,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:15:12,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:15:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:15:12,490 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:15:12,490 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 01:15:12,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:12 BoogieIcfgContainer [2018-11-23 01:15:12,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:15:12,491 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:15:12,491 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:15:12,501 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:15:12,501 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:12" (1/1) ... [2018-11-23 01:15:12,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:15:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 01:15:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 01:15:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:15:12,546 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:12,613 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-23 01:15:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 01:15:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 01:15:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:15:12,622 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:12,710 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_ceil~0 := 1.0E300;havoc main_#res;havoc main_#t~ret6, main_~x~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; VAL [ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4);ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);havoc ceil_double_#t~mem0;havoc ceil_double_#t~union1;call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4);ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);havoc ceil_double_#t~mem2;havoc ceil_double_#t~union3;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(ceil_double_~j0~0 < 20); VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ceil_double_~j0~0 > 51;BeginParallelComposition{ParallelCodeBlock0: assume 1024 == ceil_double_~j0~0;ceil_double_#res := ~someBinaryArithmeticDOUBLEoperation(ceil_double_~x, ceil_double_~x);ParallelCodeBlock1: assume !(1024 == ceil_double_~j0~0);ceil_double_#res := ceil_double_~x;}EndParallelComposition VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, |ULTIMATE.start_ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, |ULTIMATE.start_ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, |ULTIMATE.start_ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=0.0, |ULTIMATE.start_ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_~x~0, main_~res~0; [L91] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L92] ceil_double_#in~x := main_~x~0; [L92] havoc ceil_double_#res; [L92] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L23] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L26] havoc ceil_double_#t~mem2; [L26] havoc ceil_double_#t~union3; [L23] call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset); [L23] havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L29-L73] assume !(ceil_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L51-L73] assume ceil_double_~j0~0 > 51; [L52-L55] assume !(1024 == ceil_double_~j0~0); [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L92] main_#t~ret6 := ceil_double_#res; [L92] main_~res~0 := main_#t~ret6; [L92] havoc main_#t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L95-L98] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_~x~0, main_~res~0; [L91] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L92] ceil_double_#in~x := main_~x~0; [L92] havoc ceil_double_#res; [L92] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L23] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L26] havoc ceil_double_#t~mem2; [L26] havoc ceil_double_#t~union3; [L23] call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset); [L23] havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L29-L73] assume !(ceil_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L51-L73] assume ceil_double_~j0~0 > 51; [L52-L55] assume !(1024 == ceil_double_~j0~0); [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L92] main_#t~ret6 := ceil_double_#res; [L92] main_~res~0 := main_#t~ret6; [L92] havoc main_#t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L95-L98] assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_~x~0, main_~res~0; [L91] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L92] ceil_double_#in~x := main_~x~0; [L92] havoc ceil_double_#res; [L92] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0, ceil_double_#t~mem4, ceil_double_#t~union5, ceil_double_~#iw_u~0, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L23] FCALL call ceil_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(ceil_double_~x, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] FCALL call ceil_double_#t~mem0 := read~int({ base: ceil_double_~#ew_u~0!base, offset: 4 + ceil_double_~#ew_u~0!offset }, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(ceil_double_#t~union1, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] FCALL call ceil_double_#t~mem2 := read~int({ base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(ceil_double_#t~union3, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L26] havoc ceil_double_#t~mem2; [L26] havoc ceil_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(ceil_double_~#ew_u~0); [L23] havoc ceil_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(ceil_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ceil_double_~j0~0 > 51 [L52] COND FALSE !(1024 == ceil_double_~j0~0) [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L92] main_#t~ret6 := ceil_double_#res; [L92] main_~res~0 := main_#t~ret6; [L92] havoc main_#t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_~x~0, main_~res~0; [L91] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L92] ceil_double_#in~x := main_~x~0; [L92] havoc ceil_double_#res; [L92] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0, ceil_double_#t~mem4, ceil_double_#t~union5, ceil_double_~#iw_u~0, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L23] FCALL call ceil_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(ceil_double_~x, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] FCALL call ceil_double_#t~mem0 := read~int({ base: ceil_double_~#ew_u~0!base, offset: 4 + ceil_double_~#ew_u~0!offset }, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(ceil_double_#t~union1, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] FCALL call ceil_double_#t~mem2 := read~int({ base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(ceil_double_#t~union3, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L26] havoc ceil_double_#t~mem2; [L26] havoc ceil_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(ceil_double_~#ew_u~0); [L23] havoc ceil_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(ceil_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ceil_double_~j0~0 > 51 [L52] COND FALSE !(1024 == ceil_double_~j0~0) [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L92] main_#t~ret6 := ceil_double_#res; [L92] main_~res~0 := main_#t~ret6; [L92] havoc main_#t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=0.0, ceil_double_#res=0.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_ceil~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [L91] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ~j0~0 > 51 [L52] COND FALSE !(1024 == ~j0~0) [L55] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [L91] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ~j0~0 > 51 [L52] COND FALSE !(1024 == ~j0~0) [L55] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L17] static const double huge_ceil = 1.0e300; [L91] double x = -0.0; [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L51] COND TRUE j0 > 51 [L52] COND FALSE !(j0 == 0x400) [L55] return x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L92] double res = ceil_double(x); [L95] COND TRUE res != x VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L96] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-23 01:15:12,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:15:12 ImpRootNode [2018-11-23 01:15:12,750 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:15:12,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:15:12,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:15:12,751 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:15:12,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:12" (3/4) ... [2018-11-23 01:15:12,754 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:15:12,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:15:12,755 INFO L168 Benchmark]: Toolchain (without parser) took 973.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,759 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:15:12,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.13 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -216.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,760 INFO L168 Benchmark]: Boogie Preprocessor took 25.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,761 INFO L168 Benchmark]: RCFGBuilder took 414.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,761 INFO L168 Benchmark]: CodeCheck took 259.39 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:12,762 INFO L168 Benchmark]: Witness Printer took 4.09 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-23 01:15:12,765 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, 33 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: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 91, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L17] static const double huge_ceil = 1.0e300; [L91] double x = -0.0; [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L51] COND TRUE j0 > 51 [L52] COND FALSE !(j0 == 0x400) [L55] return x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L92] double res = ceil_double(x); [L95] COND TRUE res != x VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L96] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.13 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 945.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -216.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * CodeCheck took 259.39 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 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-23 01:15:14,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:15:14,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:15:14,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:15:14,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:15:14,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:15:14,224 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:15:14,225 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:15:14,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:15:14,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:15:14,228 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:15:14,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:15:14,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:15:14,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:15:14,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:15:14,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:15:14,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:15:14,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:15:14,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:15:14,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:15:14,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:15:14,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:15:14,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:15:14,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:15:14,238 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:15:14,239 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:15:14,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:15:14,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:15:14,241 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:15:14,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:15:14,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:15:14,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:15:14,242 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:15:14,242 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:15:14,243 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:15:14,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:15:14,244 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 01:15:14,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:15:14,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:15:14,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:15:14,256 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:15:14,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:15:14,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:15:14,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:15:14,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:15:14,258 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:15:14,259 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:15:14,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:15:14,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:15:14,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:15:14,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:15:14,259 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:15:14,259 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:15:14,260 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 01:15:14,260 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:15:14,260 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:15:14,260 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:15:14,260 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:15:14,260 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_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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 -> 8be2489bdcd97218605067fa4593696f9050abdf [2018-11-23 01:15:14,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:15:14,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:15:14,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:15:14,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:15:14,303 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:15:14,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c [2018-11-23 01:15:14,349 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/2ad3ff420/032c6e2a8d99405889230d44201e41a6/FLAGe8b741b39 [2018-11-23 01:15:14,683 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:15:14,683 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/sv-benchmarks/c/float-newlib/double_req_bl_1092a_true-unreach-call.c [2018-11-23 01:15:14,687 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/2ad3ff420/032c6e2a8d99405889230d44201e41a6/FLAGe8b741b39 [2018-11-23 01:15:15,116 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/data/2ad3ff420/032c6e2a8d99405889230d44201e41a6 [2018-11-23 01:15:15,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:15:15,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:15:15,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:15,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:15:15,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:15:15,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca8b490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15, skipping insertion in model container [2018-11-23 01:15:15,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:15:15,150 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:15:15,288 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:15,292 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:15:15,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:15,337 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:15:15,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15 WrapperNode [2018-11-23 01:15:15,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:15,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:15,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:15:15,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:15:15,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:15,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:15:15,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:15:15,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:15:15,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... [2018-11-23 01:15:15,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:15:15,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:15:15,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:15:15,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:15:15,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/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-23 01:15:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 01:15:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:15:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:15:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 01:15:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:15:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:15:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:15:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:15:15,593 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:15:19,666 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:15:19,666 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 01:15:19,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:19 BoogieIcfgContainer [2018-11-23 01:15:19,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:15:19,667 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:15:19,667 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:15:19,673 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:15:19,673 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:19" (1/1) ... [2018-11-23 01:15:19,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:15:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 01:15:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 01:15:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:15:19,704 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:19,736 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:15:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:19,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:15:19,764 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-23 01:15:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 01:15:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 01:15:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 01:15:19,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:19,773 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:15:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:19,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:15:19,844 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-23 01:15:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 16 states and 19 transitions. [2018-11-23 01:15:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 01:15:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 01:15:19,986 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:19,987 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:15:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:20,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:15:20,132 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-23 01:15:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2018-11-23 01:15:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 01:15:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 01:15:21,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:21,722 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:15:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:21,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:15:21,750 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-23 01:15:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 18 states and 20 transitions. [2018-11-23 01:15:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 01:15:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 01:15:21,754 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:21,755 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:15:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:21,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:15:24,608 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 12 [2018-11-23 01:15:24,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-11-23 01:15:24,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-23 01:15:24,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-11-23 01:15:24,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:15:24,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:15:24,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:15:24,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:15:24,656 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:50, output treesize:20 [2018-11-23 01:15:24,681 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-23 01:15:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 13 states and 12 transitions. [2018-11-23 01:15:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2018-11-23 01:15:27,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:15:27,160 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 6 iterations. [2018-11-23 01:15:27,168 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 01:15:27,335 INFO L579 CodeCheckObserver]: Invariant with dag size 7 [2018-11-23 01:15:27,341 INFO L579 CodeCheckObserver]: Invariant with dag size 12 [2018-11-23 01:15:27,341 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:15:27,342 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:15:27,342 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 01:15:27,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:15:27 ImpRootNode [2018-11-23 01:15:27,343 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:15:27,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:15:27,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:15:27,343 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:15:27,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:19" (3/4) ... [2018-11-23 01:15:27,346 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:15:27,352 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-23 01:15:27,352 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 01:15:27,369 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2018-11-23 01:15:27,388 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f8f973e-8a9e-4ab3-803b-ae4b55959d9c/bin-2019/ukojak/witness.graphml [2018-11-23 01:15:27,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:15:27,389 INFO L168 Benchmark]: Toolchain (without parser) took 12270.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 949.7 MB in the beginning and 789.1 MB in the end (delta: 160.7 MB). Peak memory consumption was 264.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:27,390 INFO L168 Benchmark]: CDTParser took 0.16 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-23 01:15:27,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.36 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-23 01:15:27,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.72 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-23 01:15:27,390 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 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-23 01:15:27,390 INFO L168 Benchmark]: RCFGBuilder took 4274.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 928.3 MB in the beginning and 1.0 GB in the end (delta: -117.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:27,391 INFO L168 Benchmark]: CodeCheck took 7676.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 789.1 MB in the end (delta: 257.0 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:27,391 INFO L168 Benchmark]: Witness Printer took 45.71 ms. Allocated memory is still 1.1 GB. Free memory is still 789.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:15:27,392 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, 33 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 6 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 144 SDslu, 92 SDs, 0 SdLazy, 606 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 375 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 45 ConstructedInterpolants, 7 QuantifiedInterpolants, 3309 SizeOfPredicates, 20 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 96]: 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 Derived loop invariant: \result == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 22]: Loop Invariant [2018-11-23 01:15:27,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:15:27,394 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_ceil && x == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 217.36 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 27.72 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 26.05 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 4274.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 928.3 MB in the beginning and 1.0 GB in the end (delta: -117.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * CodeCheck took 7676.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 789.1 MB in the end (delta: 257.0 MB). Peak memory consumption was 257.0 MB. Max. memory is 11.5 GB. * Witness Printer took 45.71 ms. Allocated memory is still 1.1 GB. Free memory is still 789.1 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...