./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cast_union_loose_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_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:33:22,827 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:33:22,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:33:22,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:33:22,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:33:22,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:33:22,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:33:22,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:33:22,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:33:22,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:33:22,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:33:22,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:33:22,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:33:22,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:33:22,840 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:33:22,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:33:22,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:33:22,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:33:22,843 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:33:22,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:33:22,845 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:33:22,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:33:22,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:33:22,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:33:22,848 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:33:22,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:33:22,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:33:22,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:33:22,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:33:22,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:33:22,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:33:22,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:33:22,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:33:22,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:33:22,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:33:22,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:33:22,852 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 06:33:22,859 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:33:22,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:33:22,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:33:22,859 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:33:22,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:33:22,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:33:22,860 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:33:22,860 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:33:22,860 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:33:22,860 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:33:22,860 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:33:22,861 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:33:22,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:33:22,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:33:22,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:33:22,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:33:22,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:33:22,863 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_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 [2018-11-23 06:33:22,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:33:22,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:33:22,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:33:22,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:33:22,899 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:33:22,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:22,942 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/f40728d49/8746fcb362134352b99580a1b966c2d9/FLAG6e6eff1ef [2018-11-23 06:33:23,270 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:33:23,270 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:23,274 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/f40728d49/8746fcb362134352b99580a1b966c2d9/FLAG6e6eff1ef [2018-11-23 06:33:23,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/f40728d49/8746fcb362134352b99580a1b966c2d9 [2018-11-23 06:33:23,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:33:23,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:33:23,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:23,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:33:23,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:33:23,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e17af78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23, skipping insertion in model container [2018-11-23 06:33:23,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:33:23,737 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:33:23,843 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:23,846 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:33:23,862 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:23,873 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:33:23,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23 WrapperNode [2018-11-23 06:33:23,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:23,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:23,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:33:23,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:33:23,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:23,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:33:23,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:33:23,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:33:23,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... [2018-11-23 06:33:23,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:33:23,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:33:23,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:33:23,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:33:23,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/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 06:33:23,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:33:23,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 06:33:23,971 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:33:23,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:33:23,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:33:23,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:33:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 06:33:23,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 06:33:23,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:33:24,083 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:33:24,083 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:33:24,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:24 BoogieIcfgContainer [2018-11-23 06:33:24,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:33:24,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:33:24,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:33:24,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:33:24,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:33:23" (1/3) ... [2018-11-23 06:33:24,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5181754a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:24, skipping insertion in model container [2018-11-23 06:33:24,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:23" (2/3) ... [2018-11-23 06:33:24,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5181754a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:24, skipping insertion in model container [2018-11-23 06:33:24,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:24" (3/3) ... [2018-11-23 06:33:24,089 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:24,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:33:24,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:33:24,115 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:33:24,138 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:33:24,139 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:33:24,139 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:33:24,139 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:33:24,139 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:33:24,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:33:24,139 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:33:24,139 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:33:24,139 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:33:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 06:33:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:33:24,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:24,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:24,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:24,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash 157905740, now seen corresponding path program 1 times [2018-11-23 06:33:24,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:33:24,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:33:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:24,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:33:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:33:24,281 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=1127219207, |#NULL.offset|=1127219202, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=1127219207, |old(#NULL.offset)|=1127219202] [?] RET #25#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [main_~a~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8);call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4);call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4);call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4);havoc #t~mem0;call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4);call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4);havoc #t~mem1;call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8);call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8);#res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=0, |#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] assume true; VAL [cast_~i=0, |#NULL.base|=0, |#NULL.offset|=0, |cast_#in~i|=0] [?] RET #29#return; VAL [main_~a~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=1127219208.0] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=0, main_~r~0=1127219208.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) 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=1127219207, #NULL.offset=1127219202, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL.base=0, #NULL.offset=0] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8); [L18] call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4); [L19] call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4); [L19] call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4); [L19] havoc #t~mem0; [L20] call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4); [L21] call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L21] call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8); [L22] call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L15-L23] ensures true; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] 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=1127219207, #NULL.offset=1127219202, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=1127219207, old(#NULL.offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL.base=0, #NULL.offset=0] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8); [L18] call write~int(1127219200, ~#x~0.base, ~#x~0.offset, 4); [L19] call #t~mem0 := read~int(~#x~0.base, ~#x~0.offset, 4); [L19] call write~int(#t~mem0, ~#y~0.base, ~#y~0.offset, 4); [L19] havoc #t~mem0; [L20] call write~int(-2147483648, ~#x~0.base, 4 + ~#x~0.offset, 4); [L21] call #t~mem1 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4); [L21] call write~int(~bitwiseXor(~i, #t~mem1), ~#y~0.base, 4 + ~#y~0.offset, 4); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~real(~#y~0.base, ~#y~0.offset, 8); [L22] call #t~mem3 := read~real(~#x~0.base, ~#x~0.offset, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L15-L23] ensures true; VAL [#in~i=0, #NULL.base=0, #NULL.offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L19] havoc #t~mem0; [L20] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L22] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] 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=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L19] havoc #t~mem0; [L20] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L22] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L19] havoc #t~mem0; [L20] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L22] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] 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=1127219207, #NULL!offset=1127219202, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=1127219207, old(#NULL!offset)=1127219202] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0 != (if ~a~0 >= -10000 && ~a~0 <= 10000 then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=0, #NULL!base=0, #NULL!offset=0] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#x~0!base, offset: ~#x~0!offset }, 4); [L19] FCALL call write~int(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4); [L19] havoc #t~mem0; [L20] FCALL call write~int(-2147483648, { base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call #t~mem1 := read~int({ base: ~#x~0!base, offset: 4 + ~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(~i, #t~mem1), { base: ~#y~0!base, offset: 4 + ~#y~0!offset }, 4); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~real({ base: ~#y~0!base, offset: ~#y~0!offset }, 8); [L22] FCALL call #t~mem3 := read~real({ base: ~#x~0!base, offset: ~#x~0!offset }, 8); [L22] #res := ~someBinaryArithmeticDOUBLEoperation(#t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=0, #NULL!base=0, #NULL!offset=0, ~i=0] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=1.127219208E9, ~a~0=0] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=0, ~r~0=1.127219208E9] [L34] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10000.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [L33] CALL, EXPR cast(a) VAL [\old(i)=0] [L17] union u x, y; [L18] x.i[0] = 0x43300000 [L19] EXPR x.i[0] [L19] y.i[0] = x.i[0] [L20] x.i[1] = 0x80000000 [L21] EXPR x.i[1] [L21] y.i[1] = i ^ x.i[1] [L22] EXPR y.d [L22] EXPR x.d [L22] return y.d - x.d; [L22] return y.d - x.d; [L22] return y.d - x.d; VAL [\old(i)=0, i=0] [L33] RET, EXPR cast(a) VAL [a=0, cast(a)=1127219208] [L33] r = cast(a) [L34] CALL __VERIFIER_assert(r >= -10000. && r <= 10000.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 06:33:24,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:33:24 BoogieIcfgContainer [2018-11-23 06:33:24,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:33:24,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:33:24,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:33:24,312 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:33:24,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:24" (3/4) ... [2018-11-23 06:33:24,315 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:33:24,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:33:24,315 INFO L168 Benchmark]: Toolchain (without parser) took 606.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 375.6 kB. Max. memory is 11.5 GB. [2018-11-23 06:33:24,317 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:33:24,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:24,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:33:24,318 INFO L168 Benchmark]: Boogie Preprocessor took 13.40 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:24,318 INFO L168 Benchmark]: RCFGBuilder took 182.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:24,319 INFO L168 Benchmark]: TraceAbstraction took 227.65 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:24,319 INFO L168 Benchmark]: Witness Printer took 2.70 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 06:33:24,322 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.15 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.40 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 227.65 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 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: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 22, overapproximation of bitwiseXor at line 21. Possible FailurePath: [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [L33] CALL, EXPR cast(a) VAL [\old(i)=0] [L17] union u x, y; [L18] x.i[0] = 0x43300000 [L19] EXPR x.i[0] [L19] y.i[0] = x.i[0] [L20] x.i[1] = 0x80000000 [L21] EXPR x.i[1] [L21] y.i[1] = i ^ x.i[1] [L22] EXPR y.d [L22] EXPR x.d [L22] return y.d - x.d; [L22] return y.d - x.d; [L22] return y.d - x.d; VAL [\old(i)=0, i=0] [L33] RET, EXPR cast(a) VAL [a=0, cast(a)=1127219208] [L33] r = cast(a) [L34] CALL __VERIFIER_assert(r >= -10000. && r <= 10000.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.1s 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=23occurred 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, 15 NumberOfCodeBlocks, 15 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 06:33:25,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:33:25,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:33:25,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:33:25,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:33:25,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:33:25,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:33:25,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:33:25,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:33:25,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:33:25,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:33:25,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:33:25,722 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:33:25,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:33:25,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:33:25,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:33:25,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:33:25,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:33:25,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:33:25,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:33:25,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:33:25,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:33:25,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:33:25,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:33:25,733 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:33:25,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:33:25,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:33:25,734 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:33:25,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:33:25,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:33:25,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:33:25,737 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:33:25,737 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:33:25,737 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:33:25,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:33:25,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:33:25,738 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 06:33:25,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:33:25,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:33:25,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:33:25,750 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:33:25,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:33:25,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:33:25,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:33:25,752 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:33:25,752 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:33:25,753 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:33:25,753 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:33:25,754 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:33:25,754 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:33:25,754 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_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 [2018-11-23 06:33:25,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:33:25,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:33:25,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:33:25,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:33:25,794 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:33:25,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:25,828 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/d169b7b44/83e05d42359844e6948034a4d146ae3d/FLAGa9f88bcec [2018-11-23 06:33:26,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:33:26,220 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:26,224 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/d169b7b44/83e05d42359844e6948034a4d146ae3d/FLAGa9f88bcec [2018-11-23 06:33:26,234 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/data/d169b7b44/83e05d42359844e6948034a4d146ae3d [2018-11-23 06:33:26,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:33:26,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:33:26,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:26,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:33:26,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:33:26,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26, skipping insertion in model container [2018-11-23 06:33:26,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:33:26,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:33:26,401 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:26,406 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:33:26,424 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:26,444 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:33:26,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26 WrapperNode [2018-11-23 06:33:26,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:26,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:26,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:33:26,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:33:26,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:26,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:33:26,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:33:26,466 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:33:26,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... [2018-11-23 06:33:26,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:33:26,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:33:26,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:33:26,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:33:26,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/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 06:33:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 06:33:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:33:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:33:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure cast [2018-11-23 06:33:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure cast [2018-11-23 06:33:26,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:33:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:33:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 06:33:26,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:33:26,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 06:33:26,841 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:33:26,841 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:33:26,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:26 BoogieIcfgContainer [2018-11-23 06:33:26,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:33:26,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:33:26,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:33:26,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:33:26,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:33:26" (1/3) ... [2018-11-23 06:33:26,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ca77ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:26, skipping insertion in model container [2018-11-23 06:33:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:26" (2/3) ... [2018-11-23 06:33:26,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ca77ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:26, skipping insertion in model container [2018-11-23 06:33:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:26" (3/3) ... [2018-11-23 06:33:26,847 INFO L112 eAbstractionObserver]: Analyzing ICFG cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 06:33:26,856 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:33:26,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:33:26,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:33:26,890 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:33:26,890 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:33:26,891 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:33:26,891 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:33:26,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:33:26,891 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:33:26,891 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:33:26,891 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:33:26,891 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:33:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 06:33:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 06:33:26,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:26,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:26,905 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:26,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash 157905740, now seen corresponding path program 1 times [2018-11-23 06:33:26,911 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 06:33:26,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/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 06:33:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:33:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:33:27,229 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv5 32), |#NULL.offset|=(_ bv1 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] RET #25#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet4;havoc #t~nondet4;assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [main_~a~0=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32)] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32);havoc #t~mem0;call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32);havoc #t~mem1;call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32);call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32);#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32), |cast_#res|=(_ NaN 11 53)] [?] assume true; VAL [cast_~i=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32), |cast_#res|=(_ NaN 11 53)] [?] RET #29#return; VAL [main_~a~0=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret5|=(_ NaN 11 53)] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=(_ bv4294959104 32), main_~r~0=(_ NaN 11 53), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) 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=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L19] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L19] havoc #t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L22] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L15-L23] ensures true; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L19] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L19] havoc #t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L22] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L15-L23] ensures true; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [L33] CALL, EXPR cast(a) VAL [\old(i)=4294959104] [L17] union u x, y; [L18] x.i[0] = 0x43300000 [L19] EXPR x.i[0] [L19] y.i[0] = x.i[0] [L20] x.i[1] = 0x80000000 [L21] EXPR x.i[1] [L21] y.i[1] = i ^ x.i[1] [L22] EXPR y.d [L22] EXPR x.d [L22] return y.d - x.d; [L22] return y.d - x.d; [L22] return y.d - x.d; VAL [\old(i)=4294959104, \result=NaN, i=4294959104] [L33] RET, EXPR cast(a) VAL [a=4294959104, cast(a)=NaN] [L33] r = cast(a) [L34] CALL __VERIFIER_assert(r >= -10000. && r <= 10000.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 06:33:27,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:33:27 BoogieIcfgContainer [2018-11-23 06:33:27,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:33:27,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:33:27,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:33:27,255 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:33:27,256 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:26" (3/4) ... [2018-11-23 06:33:27,258 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|=(_ bv5 32), |#NULL.offset|=(_ bv1 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv5 32), |old(#NULL.offset)|=(_ bv1 32)] [?] RET #25#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet4;havoc #t~nondet4;assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [main_~a~0=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret5 := cast(~a~0); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32)] [?] ~i := #in~i;call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32);call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32);call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32);havoc #t~mem0;call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32);havoc #t~mem1;call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32);call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32);#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3);havoc #t~mem3;havoc #t~mem2;call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset);havoc ~#x~0.base, ~#x~0.offset;call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset);havoc ~#y~0.base, ~#y~0.offset; VAL [cast_~i=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32), |cast_#res|=(_ NaN 11 53)] [?] assume true; VAL [cast_~i=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |cast_#in~i|=(_ bv4294959104 32), |cast_#res|=(_ NaN 11 53)] [?] RET #29#return; VAL [main_~a~0=(_ bv4294959104 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~ret5|=(_ NaN 11 53)] [?] ~r~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=(_ bv4294959104 32), main_~r~0=(_ NaN 11 53), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) 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=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L19] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L19] havoc #t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L22] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L15-L23] ensures true; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL.offset=1bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=5bv32, old(#NULL.offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L15-L23] ~i := #in~i; [L17] call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call ~#y~0.base, ~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, ~#x~0.base, ~#x~0.offset, 4bv32); [L19] call #t~mem0 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(#t~mem0, ~#y~0.base, ~#y~0.offset, 4bv32); [L19] havoc #t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call #t~mem1 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(~i, #t~mem1), ~#y~0.base, ~bvadd32(4bv32, ~#y~0.offset), 4bv32); [L21] havoc #t~mem1; [L22] call #t~mem2 := read~intFLOATTYPE8(~#y~0.base, ~#y~0.offset, 8bv32); [L22] call #t~mem3 := read~intFLOATTYPE8(~#x~0.base, ~#x~0.offset, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] call ULTIMATE.dealloc(~#x~0.base, ~#x~0.offset); [L22] havoc ~#x~0.base, ~#x~0.offset; [L17] call ULTIMATE.dealloc(~#y~0.base, ~#y~0.offset); [L22] havoc ~#y~0.base, ~#y~0.offset; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L15-L23] ensures true; VAL [#in~i=4294959104bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] 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=5bv32, #NULL!offset=1bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=5bv32, old(#NULL!offset)=1bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] havoc ~a~0; [L28] havoc ~r~0; [L30] ~a~0 := #t~nondet4; [L30] havoc #t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(~a~0, 4294957296bv32) && ~bvsle32(~a~0, 10000bv32) then 1bv32 else 0bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32] [L33] CALL call #t~ret5 := cast(~a~0); VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L15-L23] ~i := #in~i; [L17] FCALL call ~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call ~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(#t~mem0, { base: ~#y~0!base, offset: ~#y~0!offset }, 4bv32); [L19] havoc #t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call #t~mem1 := read~intINTTYPE4({ base: ~#x~0!base, offset: ~bvadd32(4bv32, ~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(~i, #t~mem1), { base: ~#y~0!base, offset: ~bvadd32(4bv32, ~#y~0!offset) }, 4bv32); [L21] havoc #t~mem1; [L22] FCALL call #t~mem2 := read~intFLOATTYPE8({ base: ~#y~0!base, offset: ~#y~0!offset }, 8bv32); [L22] FCALL call #t~mem3 := read~intFLOATTYPE8({ base: ~#x~0!base, offset: ~#x~0!offset }, 8bv32); [L22] #res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, #t~mem2, #t~mem3); [L22] havoc #t~mem3; [L22] havoc #t~mem2; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; VAL [#in~i=4294959104bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #res=~NaN~LONGDOUBLE(), ~i=4294959104bv32] [L33] RET call #t~ret5 := cast(~a~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~ret5=~NaN~LONGDOUBLE(), ~a~0=4294959104bv32] [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~a~0=4294959104bv32, ~r~0=~NaN~LONGDOUBLE()] [L34] CALL call __VERIFIER_assert((if ~fp.geq~DOUBLE(~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [L33] CALL, EXPR cast(a) VAL [\old(i)=4294959104] [L17] union u x, y; [L18] x.i[0] = 0x43300000 [L19] EXPR x.i[0] [L19] y.i[0] = x.i[0] [L20] x.i[1] = 0x80000000 [L21] EXPR x.i[1] [L21] y.i[1] = i ^ x.i[1] [L22] EXPR y.d [L22] EXPR x.d [L22] return y.d - x.d; [L22] return y.d - x.d; [L22] return y.d - x.d; VAL [\old(i)=4294959104, \result=NaN, i=4294959104] [L33] RET, EXPR cast(a) VAL [a=4294959104, cast(a)=NaN] [L33] r = cast(a) [L34] CALL __VERIFIER_assert(r >= -10000. && r <= 10000.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 06:33:27,290 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4a45c202-ece1-4643-921c-1a038a01c237/bin-2019/uautomizer/witness.graphml [2018-11-23 06:33:27,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:33:27,291 INFO L168 Benchmark]: Toolchain (without parser) took 1053.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:27,292 INFO L168 Benchmark]: CDTParser took 0.11 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 06:33:27,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:27,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.66 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:33:27,293 INFO L168 Benchmark]: Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:33:27,293 INFO L168 Benchmark]: RCFGBuilder took 352.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:27,293 INFO L168 Benchmark]: TraceAbstraction took 412.63 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:33:27,294 INFO L168 Benchmark]: Witness Printer took 34.99 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 06:33:27,297 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.11 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 206.29 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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 20.66 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.77 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 352.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412.63 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.99 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: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [L33] CALL, EXPR cast(a) VAL [\old(i)=4294959104] [L17] union u x, y; [L18] x.i[0] = 0x43300000 [L19] EXPR x.i[0] [L19] y.i[0] = x.i[0] [L20] x.i[1] = 0x80000000 [L21] EXPR x.i[1] [L21] y.i[1] = i ^ x.i[1] [L22] EXPR y.d [L22] EXPR x.d [L22] return y.d - x.d; [L22] return y.d - x.d; [L22] return y.d - x.d; VAL [\old(i)=4294959104, \result=NaN, i=4294959104] [L33] RET, EXPR cast(a) VAL [a=4294959104, cast(a)=NaN] [L33] r = cast(a) [L34] CALL __VERIFIER_assert(r >= -10000. && r <= 10000.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.3s 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=23occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 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 proved your program to be incorrect! Received shutdown request...