./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.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_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f322714ac20f006604c99f1f234e99ccbfae195 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f322714ac20f006604c99f1f234e99ccbfae195 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:32:48,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:32:48,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:32:48,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:32:48,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:32:48,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:32:48,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:32:48,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:32:48,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:32:48,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:32:48,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:32:48,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:32:48,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:32:48,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:32:48,274 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:32:48,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:32:48,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:32:48,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:32:48,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:32:48,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:32:48,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:32:48,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:32:48,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:32:48,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:32:48,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:32:48,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:32:48,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:32:48,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:32:48,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:32:48,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:32:48,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:32:48,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:32:48,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:32:48,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:32:48,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:32:48,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:32:48,286 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:32:48,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:32:48,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:32:48,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:32:48,294 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:32:48,295 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:32:48,295 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:32:48,296 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:32:48,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:32:48,296 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:32:48,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:32:48,297 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:32:48,298 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:32:48,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:32:48,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:32:48,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:32:48,299 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:32:48,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:32:48,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:32:48,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:32:48,302 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan 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 -> Taipan 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 -> 4f322714ac20f006604c99f1f234e99ccbfae195 [2018-11-23 05:32:48,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:32:48,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:32:48,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:32:48,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:32:48,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:32:48,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:48,388 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/d3852cd65/1aad1da7ba9d4aa288df6867f633a5d4/FLAGec635cf88 [2018-11-23 05:32:48,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:32:48,816 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:48,821 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/d3852cd65/1aad1da7ba9d4aa288df6867f633a5d4/FLAGec635cf88 [2018-11-23 05:32:48,832 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/d3852cd65/1aad1da7ba9d4aa288df6867f633a5d4 [2018-11-23 05:32:48,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:32:48,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:32:48,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:32:48,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:32:48,839 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:32:48,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:32:48" (1/1) ... [2018-11-23 05:32:48,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb4fcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:48, skipping insertion in model container [2018-11-23 05:32:48,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:32:48" (1/1) ... [2018-11-23 05:32:48,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:32:48,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:32:48,980 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:32:48,987 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:32:49,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:32:49,011 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:32:49,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49 WrapperNode [2018-11-23 05:32:49,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:32:49,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:32:49,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:32:49,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:32:49,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:32:49,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:32:49,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:32:49,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:32:49,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... [2018-11-23 05:32:49,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:32:49,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:32:49,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:32:49,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:32:49,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:32:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:32:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 05:32:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:32:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:32:49,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:32:49,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:32:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:32:49,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:32:49,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:32:49,279 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:32:49,280 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:32:49,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:49 BoogieIcfgContainer [2018-11-23 05:32:49,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:32:49,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:32:49,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:32:49,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:32:49,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:32:48" (1/3) ... [2018-11-23 05:32:49,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2961440d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:32:49, skipping insertion in model container [2018-11-23 05:32:49,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:49" (2/3) ... [2018-11-23 05:32:49,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2961440d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:32:49, skipping insertion in model container [2018-11-23 05:32:49,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:49" (3/3) ... [2018-11-23 05:32:49,287 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:49,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:32:49,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:32:49,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:32:49,340 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:32:49,340 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:32:49,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:32:49,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:32:49,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:32:49,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:32:49,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:32:49,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:32:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 05:32:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:32:49,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:32:49,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:32:49,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:32:49,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:32:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash -241609895, now seen corresponding path program 1 times [2018-11-23 05:32:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:32:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:32:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:32:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:32:49,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:32:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:32:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:32:49,498 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=3758096392, |#NULL.offset|=3758096385, |old(#NULL.base)|=3758096392, |old(#NULL.offset)|=3758096385] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3758096392, |old(#NULL.offset)|=3758096385] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=3758096392, |old(#NULL.offset)|=3758096385] [?] RET #49#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet10;havoc #t~nondet10; VAL [main_~a~0=3758096387.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := cast(~a~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0] [?] call ~#d.base, ~#d.offset := #Ultimate.alloc(8);call write~real(#in~d, ~#d.base, ~#d.offset, 8);call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8);call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4);call #t~mem0 := read~int(~#d.base, ~#d.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0, |cast_#t~mem0|=3758096391, |cast_~#d.base|=3758096386, |cast_~#d.offset|=0, |cast_~#dmax~0.base|=3758096390, |cast_~#dmax~0.offset|=0, |cast_~#f~0.base|=3758096393, |cast_~#f~0.offset|=0] [?] assume !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296);havoc #t~mem0;call write~int(1206910975, ~#dmax~0.base, ~#dmax~0.offset, 4);call write~int(3758096384, ~#dmax~0.base, 4 + ~#dmax~0.offset, 4);call #t~mem1 := read~real(~#d.base, ~#d.offset, 8);call #t~mem2 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0, |cast_#t~mem1|=3758096387.0, |cast_#t~mem2|=3758096388.0, |cast_~#d.base|=3758096386, |cast_~#d.offset|=0, |cast_~#dmax~0.base|=3758096390, |cast_~#dmax~0.offset|=0, |cast_~#f~0.base|=3758096393, |cast_~#f~0.offset|=0] [?] assume !~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2);havoc #t~mem2;havoc #t~mem1;call #t~mem3 := read~real(~#d.base, ~#d.offset, 8);call #t~mem4 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0, |cast_#t~mem3|=3758096387.0, |cast_#t~mem4|=3758096388.0, |cast_~#d.base|=3758096386, |cast_~#d.offset|=0, |cast_~#dmax~0.base|=3758096390, |cast_~#dmax~0.offset|=0, |cast_~#f~0.base|=3758096393, |cast_~#f~0.offset|=0] [?] assume !~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4);havoc #t~mem3;havoc #t~mem4;call #t~mem5 := read~real(~#d.base, ~#d.offset, 8);#t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0, |cast_#t~mem5|=3758096387.0, |cast_#t~short7|=true, |cast_~#d.base|=3758096386, |cast_~#d.offset|=0, |cast_~#dmax~0.base|=3758096390, |cast_~#dmax~0.offset|=0, |cast_~#f~0.base|=3758096393, |cast_~#f~0.offset|=0] [?] assume #t~short7;call #t~mem6 := read~real(~#d.base, ~#d.offset, 8);#t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~d|=3758096387.0, |cast_#t~mem5|=3758096387.0, |cast_#t~mem6|=3758096387.0, |cast_#t~short7|=false, |cast_~#d.base|=3758096386, |cast_~#d.offset|=0, |cast_~#dmax~0.base|=3758096390, |cast_~#dmax~0.offset|=0, |cast_~#f~0.base|=3758096393, |cast_~#f~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3758096392, #NULL.offset=3758096385, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8); [L6-L28] call write~real(#in~d, ~#d.base, ~#d.offset, 8); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4); [L11] call #t~mem0 := read~int(~#d.base, ~#d.offset, 4); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem0=3758096391, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L11] assume !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296); [L11] havoc #t~mem0; [L13] call write~int(1206910975, ~#dmax~0.base, ~#dmax~0.offset, 4); [L14] call write~int(3758096384, ~#dmax~0.base, 4 + ~#dmax~0.offset, 4); [L16] call #t~mem1 := read~real(~#d.base, ~#d.offset, 8); [L16] call #t~mem2 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L16-L25] assume !~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2); [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] call #t~mem3 := read~real(~#d.base, ~#d.offset, 8); [L19] call #t~mem4 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L19-L25] assume !~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~real(~#d.base, ~#d.offset, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L23] assume #t~short7; [L23] call #t~mem6 := read~real(~#d.base, ~#d.offset, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L3] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=3758096392, #NULL.offset=3758096385, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=3758096392, old(#NULL.offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8); [L6-L28] call write~real(#in~d, ~#d.base, ~#d.offset, 8); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4); [L11] call #t~mem0 := read~int(~#d.base, ~#d.offset, 4); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem0=3758096391, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L11] assume !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296); [L11] havoc #t~mem0; [L13] call write~int(1206910975, ~#dmax~0.base, ~#dmax~0.offset, 4); [L14] call write~int(3758096384, ~#dmax~0.base, 4 + ~#dmax~0.offset, 4); [L16] call #t~mem1 := read~real(~#d.base, ~#d.offset, 8); [L16] call #t~mem2 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L16-L25] assume !~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2); [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] call #t~mem3 := read~real(~#d.base, ~#d.offset, 8); [L19] call #t~mem4 := read~real(~#dmax~0.base, ~#dmax~0.offset, 8); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L19-L25] assume !~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~real(~#d.base, ~#d.offset, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L23] assume #t~short7; [L23] call #t~mem6 := read~real(~#d.base, ~#d.offset, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL.base=0, #NULL.offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d.base=3758096386, ~#d.offset=0, ~#dmax~0.base=3758096390, ~#dmax~0.offset=0, ~#f~0.base=3758096393, ~#f~0.offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L3] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3758096392, #NULL!offset=3758096385, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8); [L6-L28] FCALL call write~real(#in~d, ~#d, 8); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4); [L11] FCALL call #t~mem0 := read~int(~#d, 4); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem0=3758096391, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L11] COND FALSE !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296) [L11] havoc #t~mem0; [L13] FCALL call write~int(1206910975, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4); [L14] FCALL call write~int(3758096384, { base: ~#dmax~0!base, offset: 4 + ~#dmax~0!offset }, 4); [L16] FCALL call #t~mem1 := read~real(~#d, 8); [L16] FCALL call #t~mem2 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L16] COND FALSE !(~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2)) [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] FCALL call #t~mem3 := read~real(~#d, 8); [L19] FCALL call #t~mem4 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L19] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] COND TRUE #t~short7 [L23] FCALL call #t~mem6 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3758096392, #NULL!offset=3758096385, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8); [L6-L28] FCALL call write~real(#in~d, ~#d, 8); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4); [L11] FCALL call #t~mem0 := read~int(~#d, 4); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem0=3758096391, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L11] COND FALSE !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296) [L11] havoc #t~mem0; [L13] FCALL call write~int(1206910975, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4); [L14] FCALL call write~int(3758096384, { base: ~#dmax~0!base, offset: 4 + ~#dmax~0!offset }, 4); [L16] FCALL call #t~mem1 := read~real(~#d, 8); [L16] FCALL call #t~mem2 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L16] COND FALSE !(~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2)) [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] FCALL call #t~mem3 := read~real(~#d, 8); [L19] FCALL call #t~mem4 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L19] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] COND TRUE #t~short7 [L23] FCALL call #t~mem6 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3758096392, #NULL!offset=3758096385, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8); [L6-L28] FCALL call write~real(#in~d, ~#d, 8); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4); [L11] FCALL call #t~mem0 := read~int(~#d, 4); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem0=3758096391, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L11] COND FALSE !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296) [L11] havoc #t~mem0; [L13] FCALL call write~int(1206910975, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4); [L14] FCALL call write~int(3758096384, { base: ~#dmax~0!base, offset: 4 + ~#dmax~0!offset }, 4); [L16] FCALL call #t~mem1 := read~real(~#d, 8); [L16] FCALL call #t~mem2 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L16] COND FALSE !(~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2)) [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] FCALL call #t~mem3 := read~real(~#d, 8); [L19] FCALL call #t~mem4 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L19] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] COND TRUE #t~short7 [L23] FCALL call #t~mem6 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=3758096392, #NULL!offset=3758096385, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=3758096392, old(#NULL!offset)=3758096385] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=3.758096387E9] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8); [L6-L28] FCALL call write~real(#in~d, ~#d, 8); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4); [L11] FCALL call #t~mem0 := read~int(~#d, 4); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem0=3758096391, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L11] COND FALSE !(2047 == ~bitwiseAnd(#t~mem0, 2146435072) / 1048576 % 4294967296) [L11] havoc #t~mem0; [L13] FCALL call write~int(1206910975, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4); [L14] FCALL call write~int(3758096384, { base: ~#dmax~0!base, offset: 4 + ~#dmax~0!offset }, 4); [L16] FCALL call #t~mem1 := read~real(~#d, 8); [L16] FCALL call #t~mem2 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem1=3.758096387E9, #t~mem2=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L16] COND FALSE !(~someBinaryDOUBLEComparisonOperation(#t~mem1, #t~mem2)) [L16] havoc #t~mem2; [L16] havoc #t~mem1; [L19] FCALL call #t~mem3 := read~real(~#d, 8); [L19] FCALL call #t~mem4 := read~real(~#dmax~0, 8); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem3=3.758096387E9, #t~mem4=3.758096388E9, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L19] COND FALSE !(~someBinaryDOUBLEComparisonOperation(~someUnaryDOUBLEoperation(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem5, ~someUnaryDOUBLEoperation(3.41E38)); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~short7=true, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] COND TRUE #t~short7 [L23] FCALL call #t~mem6 := read~real(~#d, 8); [L23] #t~short7 := ~someBinaryDOUBLEComparisonOperation(#t~mem6, 3.41E38); VAL [#in~d=3.758096387E9, #NULL!base=0, #NULL!offset=0, #t~mem5=3.758096387E9, #t~mem6=3.758096387E9, #t~short7=false, ~#d!base=3758096386, ~#d!offset=0, ~#dmax~0!base=3758096390, ~#dmax~0!offset=0, ~#f~0!base=3758096393, ~#f~0!offset=0] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L3] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L32] double a; [L33] float r; [L35] a = __VERIFIER_nondet_double() [L36] CALL cast(a) VAL [\old(d)=3758096387] [L8] double dmax; [L9] float f; [L11] EXPR \read(d) VAL [\old(d)=3758096387, \read(d)=3758096391, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L11] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L13] ((unsigned*)&dmax)[0] = 0x47efffff [L14] ((unsigned*)&dmax)[1] = 0xe0000000 [L16] EXPR \read(d) [L16] EXPR \read(dmax) VAL [\old(d)=3758096387, \read(d)=3758096387, \read(dmax)=3758096388, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L16] COND FALSE !(d > dmax) [L19] EXPR \read(d) [L19] EXPR \read(dmax) VAL [\old(d)=3758096387, \read(d)=3758096387, \read(dmax)=3758096388, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L19] COND FALSE !(-d > dmax) [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=3758096387, \read(d)=3758096387, \read(d)=3758096387, d={3758096386:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={3758096390:0}, f={3758096393:0}] [L23] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:32:49,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:32:49 BoogieIcfgContainer [2018-11-23 05:32:49,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:32:49,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:32:49,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:32:49,534 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:32:49,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:49" (3/4) ... [2018-11-23 05:32:49,537 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:32:49,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:32:49,538 INFO L168 Benchmark]: Toolchain (without parser) took 703.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -124.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,539 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:32:49,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.77 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,541 INFO L168 Benchmark]: Boogie Preprocessor took 57.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,542 INFO L168 Benchmark]: RCFGBuilder took 192.43 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,542 INFO L168 Benchmark]: TraceAbstraction took 253.07 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:49,543 INFO L168 Benchmark]: Witness Printer took 3.42 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 05:32:49,545 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.32 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.77 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 192.43 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 253.07 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.42 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 23, overapproximation of bitwiseAnd at line 11. Possible FailurePath: [L32] double a; [L33] float r; [L35] a = __VERIFIER_nondet_double() [L36] CALL cast(a) VAL [\old(d)=3758096387] [L8] double dmax; [L9] float f; [L11] EXPR \read(d) VAL [\old(d)=3758096387, \read(d)=3758096391, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L11] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L13] ((unsigned*)&dmax)[0] = 0x47efffff [L14] ((unsigned*)&dmax)[1] = 0xe0000000 [L16] EXPR \read(d) [L16] EXPR \read(dmax) VAL [\old(d)=3758096387, \read(d)=3758096387, \read(dmax)=3758096388, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L16] COND FALSE !(d > dmax) [L19] EXPR \read(d) [L19] EXPR \read(dmax) VAL [\old(d)=3758096387, \read(d)=3758096387, \read(dmax)=3758096388, d={3758096386:0}, dmax={3758096390:0}, f={3758096393:0}] [L19] COND FALSE !(-d > dmax) [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=3758096387, \read(d)=3758096387, \read(d)=3758096387, d={3758096386:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={3758096390:0}, f={3758096393:0}] [L23] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 05:32:51,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:32:51,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:32:51,047 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:32:51,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:32:51,048 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:32:51,049 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:32:51,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:32:51,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:32:51,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:32:51,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:32:51,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:32:51,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:32:51,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:32:51,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:32:51,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:32:51,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:32:51,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:32:51,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:32:51,061 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:32:51,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:32:51,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:32:51,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:32:51,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:32:51,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:32:51,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:32:51,066 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:32:51,067 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:32:51,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:32:51,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:32:51,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:32:51,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:32:51,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:32:51,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:32:51,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:32:51,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:32:51,071 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 05:32:51,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:32:51,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:32:51,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:32:51,083 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:32:51,083 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:32:51,083 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:32:51,084 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:32:51,084 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:32:51,084 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:32:51,084 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:32:51,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:32:51,085 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:32:51,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:32:51,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:32:51,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:32:51,087 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:32:51,088 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_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan 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 -> Taipan 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 -> 4f322714ac20f006604c99f1f234e99ccbfae195 [2018-11-23 05:32:51,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:32:51,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:32:51,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:32:51,132 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:32:51,132 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:32:51,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/../../sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:51,187 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/fa2461f7d/4e585a138d1842e785e7c5301174d70a/FLAG04d585e00 [2018-11-23 05:32:51,512 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:32:51,512 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/sv-benchmarks/c/float-benchs/cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:51,516 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/fa2461f7d/4e585a138d1842e785e7c5301174d70a/FLAG04d585e00 [2018-11-23 05:32:51,951 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/data/fa2461f7d/4e585a138d1842e785e7c5301174d70a [2018-11-23 05:32:51,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:32:51,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:32:51,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:32:51,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:32:51,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:32:51,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:32:51" (1/1) ... [2018-11-23 05:32:51,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48fd148a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:51, skipping insertion in model container [2018-11-23 05:32:51,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:32:51" (1/1) ... [2018-11-23 05:32:51,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:32:51,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:32:52,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:32:52,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:32:52,140 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:32:52,154 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:32:52,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52 WrapperNode [2018-11-23 05:32:52,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:32:52,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:32:52,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:32:52,155 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:32:52,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:32:52,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:32:52,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:32:52,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:32:52,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... [2018-11-23 05:32:52,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:32:52,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:32:52,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:32:52,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:32:52,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:32:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 05:32:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 05:32:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:32:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:32:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:32:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:32:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 05:32:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:32:52,379 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 05:32:52,465 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 05:32:52,481 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:32:52,481 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:32:52,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:52 BoogieIcfgContainer [2018-11-23 05:32:52,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:32:52,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:32:52,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:32:52,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:32:52,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:32:51" (1/3) ... [2018-11-23 05:32:52,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ea3657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:32:52, skipping insertion in model container [2018-11-23 05:32:52,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:32:52" (2/3) ... [2018-11-23 05:32:52,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ea3657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:32:52, skipping insertion in model container [2018-11-23 05:32:52,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:52" (3/3) ... [2018-11-23 05:32:52,486 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_float_ptr_false-unreach-call_true-termination.c [2018-11-23 05:32:52,493 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:32:52,497 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:32:52,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:32:52,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:32:52,534 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:32:52,534 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:32:52,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:32:52,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:32:52,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:32:52,535 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:32:52,535 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:32:52,535 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:32:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 05:32:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:32:52,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:32:52,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:32:52,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:32:52,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:32:52,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1713573888, now seen corresponding path program 1 times [2018-11-23 05:32:52,557 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:32:52,557 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 05:32:52,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:32:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:32:52,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:32:52,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-11-23 05:32:52,685 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 13 treesize of output 16 [2018-11-23 05:32:52,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:32:52,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:32:52,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 05:32:52,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:32:52,729 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:32:52,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:32:52,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:32:52,780 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:107, output treesize:107 [2018-11-23 05:32:52,998 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 05:32:53,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:32:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:32:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:32:53,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:32:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:32:53,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:32:53,034 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-23 05:32:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:32:53,487 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 05:32:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:32:53,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 05:32:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:32:53,502 INFO L225 Difference]: With dead ends: 44 [2018-11-23 05:32:53,503 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 05:32:53,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:32:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 05:32:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 05:32:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 05:32:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2018-11-23 05:32:53,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 16 [2018-11-23 05:32:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:32:53,531 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2018-11-23 05:32:53,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:32:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2018-11-23 05:32:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:32:53,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:32:53,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:32:53,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:32:53,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:32:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1711726846, now seen corresponding path program 1 times [2018-11-23 05:32:53,533 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 05:32:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 05:32:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:32:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:32:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:32:53,653 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv6 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #51#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet10;havoc #t~nondet10; VAL [main_~a~0=(_ NaN 11 53), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret11 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53)] [?] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32);call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32);call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32);call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem0|=(_ bv0 32), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32));havoc #t~mem0;call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32);call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32);call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem1|=(_ NaN 11 53), |cast_#t~mem2|=(fp #b1 #b11000000000 #b0000000000000000000001000111111011111111111111111111), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2);havoc #t~mem1;havoc #t~mem2;call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem3|=(_ NaN 11 53), |cast_#t~mem4|=(fp #b1 #b11000000000 #b0000000000000000000001000111111011111111111111111111), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4);havoc #t~mem3;havoc #t~mem4;call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);#t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem5|=(_ NaN 11 53), |cast_#t~short7|=false, |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !#t~short7; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem5|=(_ NaN 11 53), |cast_#t~short7|=false, |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32); [L6-L28] call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32); [L11] call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L11] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)); [L11] havoc #t~mem0; [L13] call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32); [L14] call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32); [L16] call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L16] call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L16-L25] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2); [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L19] call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L19-L25] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] assume !#t~short7; VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32); [L6-L28] call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32); [L11] call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L11] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)); [L11] havoc #t~mem0; [L13] call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32); [L14] call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32); [L16] call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L16] call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L16-L25] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2); [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L19] call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L19-L25] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] assume !#t~short7; VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L32] double a; [L33] float r; [L35] a = __VERIFIER_nondet_double() [L36] CALL cast(a) VAL [\old(d)=NaN] [L8] double dmax; [L9] float f; [L11] EXPR \read(d) VAL [\old(d)=NaN, \read(d)=0, d={1:0}, dmax={2:0}, f={3:0}] [L11] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L13] ((unsigned*)&dmax)[0] = 0x47efffff [L14] ((unsigned*)&dmax)[1] = 0xe0000000 [L16] EXPR \read(d) [L16] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L16] COND FALSE !(d > dmax) [L19] EXPR \read(d) [L19] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L19] COND FALSE !(-d > dmax) [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=NaN, \read(d)=NaN, d={1:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={2:0}, f={3:0}] [L23] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:32:53,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:32:53 BoogieIcfgContainer [2018-11-23 05:32:53,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:32:53,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:32:53,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:32:53,692 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:32:53,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:32:52" (3/4) ... [2018-11-23 05:32:53,695 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv6 32), |#NULL.offset|=(_ bv5 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv6 32), |old(#NULL.offset)|=(_ bv5 32)] [?] RET #51#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet10;havoc #t~nondet10; VAL [main_~a~0=(_ NaN 11 53), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret11 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53)] [?] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32);call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32);call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32);call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32);call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem0|=(_ bv0 32), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32));havoc #t~mem0;call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32);call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32);call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem1|=(_ NaN 11 53), |cast_#t~mem2|=(fp #b1 #b11000000000 #b0000000000000000000001000111111011111111111111111111), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2);havoc #t~mem1;havoc #t~mem2;call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem3|=(_ NaN 11 53), |cast_#t~mem4|=(fp #b1 #b11000000000 #b0000000000000000000001000111111011111111111111111111), |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4);havoc #t~mem3;havoc #t~mem4;call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32);#t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem5|=(_ NaN 11 53), |cast_#t~short7|=false, |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] assume !#t~short7; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~d|=(_ NaN 11 53), |cast_#t~mem5|=(_ NaN 11 53), |cast_#t~short7|=false, |cast_~#d.base|=(_ bv1 32), |cast_~#d.offset|=(_ bv0 32), |cast_~#dmax~0.base|=(_ bv2 32), |cast_~#dmax~0.offset|=(_ bv0 32), |cast_~#f~0.base|=(_ bv3 32), |cast_~#f~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32); [L6-L28] call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32); [L11] call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L11] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)); [L11] havoc #t~mem0; [L13] call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32); [L14] call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32); [L16] call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L16] call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L16-L25] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2); [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L19] call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L19-L25] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] assume !#t~short7; VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6bv32, #NULL.offset=5bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=6bv32, old(#NULL.offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32] [L6-L28] call ~#d.base, ~#d.offset := #Ultimate.alloc(8bv32); [L6-L28] call write~intFLOATTYPE8(#in~d, ~#d.base, ~#d.offset, 8bv32); [L8] call ~#dmax~0.base, ~#dmax~0.offset := #Ultimate.alloc(8bv32); [L9] call ~#f~0.base, ~#f~0.offset := #Ultimate.alloc(4bv32); [L11] call #t~mem0 := read~intINTTYPE4(~#d.base, ~#d.offset, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L11] assume !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)); [L11] havoc #t~mem0; [L13] call write~intINTTYPE4(1206910975bv32, ~#dmax~0.base, ~#dmax~0.offset, 4bv32); [L14] call write~intINTTYPE4(3758096384bv32, ~#dmax~0.base, ~bvadd32(4bv32, ~#dmax~0.offset), 4bv32); [L16] call #t~mem1 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L16] call #t~mem2 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L16-L25] assume !~fp.gt~DOUBLE(#t~mem1, #t~mem2); [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] call #t~mem3 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L19] call #t~mem4 := read~intFLOATTYPE8(~#dmax~0.base, ~#dmax~0.offset, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L19-L25] assume !~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4); [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] call #t~mem5 := read~intFLOATTYPE8(~#d.base, ~#d.offset, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] assume !#t~short7; VAL [#in~d=~NaN~LONGDOUBLE(), #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d.base=1bv32, ~#d.offset=0bv32, ~#dmax~0.base=2bv32, ~#dmax~0.offset=0bv32, ~#f~0.base=3bv32, ~#f~0.offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6bv32, #NULL!offset=5bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=6bv32, old(#NULL!offset)=5bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L32] havoc ~a~0; [L33] havoc ~r~0; [L35] ~a~0 := #t~nondet10; [L35] havoc #t~nondet10; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=~NaN~LONGDOUBLE()] [L36] CALL call #t~ret11 := cast(~a~0); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32] [L6-L28] FCALL call ~#d := #Ultimate.alloc(8bv32); [L6-L28] FCALL call write~intFLOATTYPE8(#in~d, ~#d, 8bv32); [L8] FCALL call ~#dmax~0 := #Ultimate.alloc(8bv32); [L9] FCALL call ~#f~0 := #Ultimate.alloc(4bv32); [L11] FCALL call #t~mem0 := read~intINTTYPE4(~#d, 4bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L11] COND FALSE !(2047bv32 == ~bvlshr32(~bvand32(2146435072bv32, #t~mem0), 20bv32)) [L11] havoc #t~mem0; [L13] FCALL call write~intINTTYPE4(1206910975bv32, { base: ~#dmax~0!base, offset: ~#dmax~0!offset }, 4bv32); [L14] FCALL call write~intINTTYPE4(3758096384bv32, { base: ~#dmax~0!base, offset: ~bvadd32(4bv32, ~#dmax~0!offset) }, 4bv32); [L16] FCALL call #t~mem1 := read~intFLOATTYPE8(~#d, 8bv32); [L16] FCALL call #t~mem2 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem1=~NaN~LONGDOUBLE(), #t~mem2=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L16] COND FALSE !(~fp.gt~DOUBLE(#t~mem1, #t~mem2)) [L16] havoc #t~mem1; [L16] havoc #t~mem2; [L19] FCALL call #t~mem3 := read~intFLOATTYPE8(~#d, 8bv32); [L19] FCALL call #t~mem4 := read~intFLOATTYPE8(~#dmax~0, 8bv32); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=~NaN~LONGDOUBLE(), #t~mem4=~fp~LONGDOUBLE(1bv1, 1536bv11, 1206910975bv52), ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L19] COND FALSE !(~fp.gt~DOUBLE(~fp.neg~DOUBLE(#t~mem3), #t~mem4)) [L19] havoc #t~mem3; [L19] havoc #t~mem4; [L23] FCALL call #t~mem5 := read~intFLOATTYPE8(~#d, 8bv32); [L23] #t~short7 := ~fp.geq~DOUBLE(#t~mem5, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 3.41E38))); VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] COND FALSE !(#t~short7) VAL [#in~d=~NaN~LONGDOUBLE(), #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem5=~NaN~LONGDOUBLE(), #t~short7=false, ~#d!base=1bv32, ~#d!offset=0bv32, ~#dmax~0!base=2bv32, ~#dmax~0!offset=0bv32, ~#f~0!base=3bv32, ~#f~0!offset=0bv32] [L23] CALL call __VERIFIER_assert((if #t~short7 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L3] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L32] double a; [L33] float r; [L35] a = __VERIFIER_nondet_double() [L36] CALL cast(a) VAL [\old(d)=NaN] [L8] double dmax; [L9] float f; [L11] EXPR \read(d) VAL [\old(d)=NaN, \read(d)=0, d={1:0}, dmax={2:0}, f={3:0}] [L11] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L13] ((unsigned*)&dmax)[0] = 0x47efffff [L14] ((unsigned*)&dmax)[1] = 0xe0000000 [L16] EXPR \read(d) [L16] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L16] COND FALSE !(d > dmax) [L19] EXPR \read(d) [L19] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L19] COND FALSE !(-d > dmax) [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=NaN, \read(d)=NaN, d={1:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={2:0}, f={3:0}] [L23] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 05:32:53,740 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05851b93-33a4-4d57-8f98-4f89990227be/bin-2019/utaipan/witness.graphml [2018-11-23 05:32:53,740 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:32:53,741 INFO L168 Benchmark]: Toolchain (without parser) took 1787.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -54.3 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:53,742 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 05:32:53,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:53,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.05 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:32:53,744 INFO L168 Benchmark]: Boogie Preprocessor took 21.64 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:32:53,744 INFO L168 Benchmark]: RCFGBuilder took 286.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:53,744 INFO L168 Benchmark]: TraceAbstraction took 1209.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:32:53,745 INFO L168 Benchmark]: Witness Printer took 48.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:32:53,747 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 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 18.05 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.64 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 286.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1209.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * Witness Printer took 48.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L32] double a; [L33] float r; [L35] a = __VERIFIER_nondet_double() [L36] CALL cast(a) VAL [\old(d)=NaN] [L8] double dmax; [L9] float f; [L11] EXPR \read(d) VAL [\old(d)=NaN, \read(d)=0, d={1:0}, dmax={2:0}, f={3:0}] [L11] COND FALSE !((((*(unsigned*)&d) & 0x7FF00000) >> 20) == 2047) [L13] ((unsigned*)&dmax)[0] = 0x47efffff [L14] ((unsigned*)&dmax)[1] = 0xe0000000 [L16] EXPR \read(d) [L16] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L16] COND FALSE !(d > dmax) [L19] EXPR \read(d) [L19] EXPR \read(dmax) VAL [\old(d)=NaN, \read(d)=NaN, \read(dmax)=-26815623046150350000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, d={1:0}, dmax={2:0}, f={3:0}] [L19] COND FALSE !(-d > dmax) [L23] EXPR \read(d) [L23] EXPR d >= -3.41e38 && d <= 3.41e38 VAL [\old(d)=NaN, \read(d)=NaN, d={1:0}, d >= -3.41e38 && d <= 3.41e38=0, dmax={2:0}, f={3:0}] [L23] CALL __VERIFIER_assert(d >= -3.41e38 && d <= 3.41e38) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 3 SDslu, 36 SDs, 0 SdLazy, 26 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 3 QuantifiedInterpolants, 5130 SizeOfPredicates, 3 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...