./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_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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 12:39:26,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:39:26,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:39:26,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:39:26,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:39:26,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:39:26,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:39:26,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:39:26,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:39:26,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:39:26,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:39:26,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:39:26,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:39:26,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:39:26,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:39:26,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:39:26,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:39:26,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:39:26,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:39:26,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:39:26,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:39:26,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:39:26,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:39:26,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:39:26,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:39:26,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:39:27,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:39:27,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:39:27,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:39:27,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:39:27,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:39:27,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:39:27,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:39:27,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:39:27,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:39:27,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:39:27,005 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 12:39:27,016 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:39:27,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:39:27,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:39:27,017 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 12:39:27,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:39:27,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:39:27,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:39:27,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:39:27,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:39:27,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:39:27,019 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:39:27,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:39:27,019 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 12:39:27,019 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 12:39:27,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:39:27,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:39:27,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:39:27,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:39:27,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:39:27,020 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:39:27,020 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 12:39:27,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:39:27,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:39:27,021 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_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 [2018-11-23 12:39:27,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:39:27,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:39:27,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:39:27,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:39:27,056 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:39:27,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 12:39:27,095 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/abbdaebff/cebcd3699c57415aa5863d603bd19a17/FLAG050bb730a [2018-11-23 12:39:27,439 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:39:27,440 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 12:39:27,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/abbdaebff/cebcd3699c57415aa5863d603bd19a17/FLAG050bb730a [2018-11-23 12:39:27,862 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/abbdaebff/cebcd3699c57415aa5863d603bd19a17 [2018-11-23 12:39:27,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:39:27,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:39:27,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:27,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:39:27,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:39:27,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:27" (1/1) ... [2018-11-23 12:39:27,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed7d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:27, skipping insertion in model container [2018-11-23 12:39:27,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:27" (1/1) ... [2018-11-23 12:39:27,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:39:27,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:39:28,018 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:28,021 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:39:28,039 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:28,052 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:39:28,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28 WrapperNode [2018-11-23 12:39:28,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:28,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:28,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:39:28,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:39:28,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:28,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:39:28,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:39:28,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:39:28,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:39:28,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:39:28,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:39:28,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:39:28,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:39:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 12:39:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:39:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:39:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:39:28,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:39:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:39:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:39:28,453 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:39:28,453 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:39:28,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:28 BoogieIcfgContainer [2018-11-23 12:39:28,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:39:28,454 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 12:39:28,454 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 12:39:28,462 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 12:39:28,462 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:28" (1/1) ... [2018-11-23 12:39:28,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:39:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-23 12:39:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-11-23 12:39:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 12:39:28,512 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:39:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:28,656 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~a~0 := main_#t~nondet4;havoc main_#t~nondet4;assume 0 != (if main_~a~0 >= -10000 && main_~a~0 <= 10000 then 1 else 0);cast_#in~i := main_~a~0;havoc cast_#res;havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset;cast_~i := cast_#in~i;call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8);call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8);call write~int(1127219200, cast_~#x~0.base, cast_~#x~0.offset, 4);call cast_#t~mem0 := read~int(cast_~#x~0.base, cast_~#x~0.offset, 4);call write~int(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4);havoc cast_#t~mem0;call write~int(-2147483648, cast_~#x~0.base, 4 + cast_~#x~0.offset, 4);call cast_#t~mem1 := read~int(cast_~#x~0.base, 4 + cast_~#x~0.offset, 4);call write~int(~bitwiseXor(cast_~i, cast_#t~mem1), cast_~#y~0.base, 4 + cast_~#y~0.offset, 4);havoc cast_#t~mem1;call cast_#t~mem2 := read~real(cast_~#y~0.base, cast_~#y~0.offset, 8);call cast_#t~mem3 := read~real(cast_~#x~0.base, cast_~#x~0.offset, 8);cast_#res := ~someBinaryArithmeticDOUBLEoperation(cast_#t~mem2, cast_#t~mem3);havoc cast_#t~mem2;havoc cast_#t~mem3;call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset);havoc cast_~#x~0.base, cast_~#x~0.offset;call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset);havoc cast_~#y~0.base, cast_~#y~0.offset;main_#t~ret5 := cast_#res;main_~r~0 := main_#t~ret5;havoc main_#t~ret5;__VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10000.0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_cast_~i=0, ULTIMATE.start_main_~a~0=0, ULTIMATE.start_main_~r~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_cast_#in~i|=0, |ULTIMATE.start_cast_#res|=1.0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_cast_~i=0, ULTIMATE.start_main_~a~0=0, ULTIMATE.start_main_~r~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_cast_#in~i|=0, |ULTIMATE.start_cast_#res|=1.0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_cast_~i=0, ULTIMATE.start_main_~a~0=0, ULTIMATE.start_main_~r~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_cast_#in~i|=0, |ULTIMATE.start_cast_#res|=1.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0 != (if main_~a~0 >= -10000 && main_~a~0 <= 10000 then 1 else 0); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8); [L18] call write~int(1127219200, cast_~#x~0.base, cast_~#x~0.offset, 4); [L19] call cast_#t~mem0 := read~int(cast_~#x~0.base, cast_~#x~0.offset, 4); [L19] call write~int(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4); [L19] havoc cast_#t~mem0; [L20] call write~int(-2147483648, cast_~#x~0.base, 4 + cast_~#x~0.offset, 4); [L21] call cast_#t~mem1 := read~int(cast_~#x~0.base, 4 + cast_~#x~0.offset, 4); [L21] call write~int(~bitwiseXor(cast_~i, cast_#t~mem1), cast_~#y~0.base, 4 + cast_~#y~0.offset, 4); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~real(cast_~#y~0.base, cast_~#y~0.offset, 8); [L22] call cast_#t~mem3 := read~real(cast_~#x~0.base, cast_~#x~0.offset, 8); [L22] cast_#res := ~someBinaryArithmeticDOUBLEoperation(cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10000.0) then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0 != (if main_~a~0 >= -10000 && main_~a~0 <= 10000 then 1 else 0); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8); [L18] call write~int(1127219200, cast_~#x~0.base, cast_~#x~0.offset, 4); [L19] call cast_#t~mem0 := read~int(cast_~#x~0.base, cast_~#x~0.offset, 4); [L19] call write~int(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4); [L19] havoc cast_#t~mem0; [L20] call write~int(-2147483648, cast_~#x~0.base, 4 + cast_~#x~0.offset, 4); [L21] call cast_#t~mem1 := read~int(cast_~#x~0.base, 4 + cast_~#x~0.offset, 4); [L21] call write~int(~bitwiseXor(cast_~i, cast_#t~mem1), cast_~#y~0.base, 4 + cast_~#y~0.offset, 4); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~real(cast_~#y~0.base, cast_~#y~0.offset, 8); [L22] call cast_#t~mem3 := read~real(cast_~#x~0.base, cast_~#x~0.offset, 8); [L22] cast_#res := ~someBinaryArithmeticDOUBLEoperation(cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10000.0) then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0 != (if main_~a~0 >= -10000 && main_~a~0 <= 10000 then 1 else 0); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4); [L19] FCALL call cast_#t~mem0 := read~int({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4); [L19] FCALL call write~int(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4); [L19] havoc cast_#t~mem0; [L20] FCALL call write~int(-2147483648, { base: cast_~#x~0!base, offset: 4 + cast_~#x~0!offset }, 4); [L21] FCALL call cast_#t~mem1 := read~int({ base: cast_~#x~0!base, offset: 4 + cast_~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: 4 + cast_~#y~0!offset }, 4); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~real({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8); [L22] FCALL call cast_#t~mem3 := read~real({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8); [L22] cast_#res := ~someBinaryArithmeticDOUBLEoperation(cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10000.0) then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0 != (if main_~a~0 >= -10000 && main_~a~0 <= 10000 then 1 else 0); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8); [L18] FCALL call write~int(1127219200, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4); [L19] FCALL call cast_#t~mem0 := read~int({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4); [L19] FCALL call write~int(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4); [L19] havoc cast_#t~mem0; [L20] FCALL call write~int(-2147483648, { base: cast_~#x~0!base, offset: 4 + cast_~#x~0!offset }, 4); [L21] FCALL call cast_#t~mem1 := read~int({ base: cast_~#x~0!base, offset: 4 + cast_~#x~0!offset }, 4); [L21] FCALL call write~int(~bitwiseXor(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: 4 + cast_~#y~0!offset }, 4); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~real({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8); [L22] FCALL call cast_#t~mem3 := read~real({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8); [L22] cast_#res := ~someBinaryArithmeticDOUBLEoperation(cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~someUnaryDOUBLEoperation(10000.0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10000.0) then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, cast_#in~i=0, cast_#res=1.0, cast_~i=0, main_~a~0=0, main_~r~0=1.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L8] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L8] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [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; [L33] r = cast(a) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() ----- [2018-11-23 12:39:28,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:39:28 ImpRootNode [2018-11-23 12:39:28,680 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 12:39:28,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:39:28,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:39:28,680 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:39:28,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:28" (3/4) ... [2018-11-23 12:39:28,683 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:39:28,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:39:28,684 INFO L168 Benchmark]: Toolchain (without parser) took 819.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:28,686 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:28,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:28,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:28,687 INFO L168 Benchmark]: Boogie Preprocessor took 64.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:28,688 INFO L168 Benchmark]: RCFGBuilder took 299.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:28,689 INFO L168 Benchmark]: CodeCheck took 225.80 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:28,690 INFO L168 Benchmark]: Witness Printer took 3.46 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 12:39:28,694 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 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 someBinaryDOUBLEComparisonOperation at line 34, overapproximation of bitwiseXor at line 21. Possible FailurePath: [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [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; [L33] r = cast(a) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.54 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 946.2 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 36.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * CodeCheck took 225.80 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 12:39:30,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:39:30,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:39:30,247 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:39:30,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:39:30,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:39:30,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:39:30,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:39:30,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:39:30,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:39:30,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:39:30,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:39:30,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:39:30,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:39:30,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:39:30,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:39:30,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:39:30,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:39:30,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:39:30,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:39:30,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:39:30,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:39:30,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:39:30,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:39:30,265 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:39:30,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:39:30,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:39:30,267 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:39:30,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:39:30,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:39:30,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:39:30,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:39:30,270 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:39:30,270 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:39:30,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:39:30,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:39:30,271 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 12:39:30,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:39:30,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:39:30,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:39:30,284 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 12:39:30,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:39:30,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:39:30,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:39:30,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:39:30,286 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:39:30,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:39:30,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:39:30,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:39:30,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:39:30,287 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 12:39:30,287 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 12:39:30,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:39:30,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:39:30,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:39:30,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:39:30,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:39:30,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:39:30,289 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 12:39:30,289 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 12:39:30,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:39:30,289 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:39:30,289 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:39:30,289 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_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab78e88e866bccb3788105d7b85f6b41d9bbaf2 [2018-11-23 12:39:30,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:39:30,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:39:30,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:39:30,338 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:39:30,338 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:39:30,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 12:39:30,386 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/d01f56574/845194c495b243b3b6131b76c2ef3ee1/FLAG26c52d50e [2018-11-23 12:39:30,739 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:39:30,740 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/sv-benchmarks/c/float-benchs/cast_union_loose_false-unreach-call_true-termination.c [2018-11-23 12:39:30,745 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/d01f56574/845194c495b243b3b6131b76c2ef3ee1/FLAG26c52d50e [2018-11-23 12:39:30,754 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/data/d01f56574/845194c495b243b3b6131b76c2ef3ee1 [2018-11-23 12:39:30,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:39:30,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:39:30,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:30,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:39:30,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:39:30,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:30,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30, skipping insertion in model container [2018-11-23 12:39:30,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:30,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:39:30,786 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:39:30,940 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:30,944 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:39:30,965 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:39:30,988 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:39:30,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30 WrapperNode [2018-11-23 12:39:30,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:39:30,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:30,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:39:30,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:39:30,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:39:31,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:39:31,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:39:31,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:39:31,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... [2018-11-23 12:39:31,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:39:31,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:39:31,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:39:31,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:39:31,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:39:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:39:31,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 12:39:31,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:39:31,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 12:39:31,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:39:31,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:39:31,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:39:31,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 12:39:31,933 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:39:31,933 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:39:31,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:31 BoogieIcfgContainer [2018-11-23 12:39:31,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:39:31,935 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 12:39:31,935 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 12:39:31,949 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 12:39:31,950 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:31" (1/1) ... [2018-11-23 12:39:31,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:39:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:39:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-23 12:39:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-11-23 12:39:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 12:39:31,985 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:39:32,035 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 12:39:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:39:32,255 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet4;havoc main_#t~nondet4;assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32);cast_#in~i := main_~a~0;havoc cast_#res;havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset;cast_~i := cast_#in~i;call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32);call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32);call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32);call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32);havoc cast_#t~mem0;call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32);call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32);havoc cast_#t~mem1;call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32);call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32);cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3);havoc cast_#t~mem2;havoc cast_#t~mem3;call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset);havoc cast_~#x~0.base, cast_~#x~0.offset;call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset);havoc cast_~#y~0.base, cast_~#y~0.offset;main_#t~ret5 := cast_#res;main_~r~0 := main_#t~ret5;havoc main_#t~ret5;__VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] assume 0bv32 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32); [L19] havoc cast_#t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32); [L22] call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assume 0bv32 == __VERIFIER_assert_~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32); [L19] havoc cast_#t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32); [L22] call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assume 0bv32 == __VERIFIER_assert_~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call cast_#t~mem0 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4bv32); [L19] havoc cast_#t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call cast_#t~mem1 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: ~bvadd32(4bv32, cast_~#y~0!offset) }, 4bv32); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~intFLOATTYPE8({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8bv32); [L22] FCALL call cast_#t~mem3 := read~intFLOATTYPE8({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] COND TRUE 0bv32 == __VERIFIER_assert_~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call cast_#t~mem0 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4bv32); [L19] havoc cast_#t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call cast_#t~mem1 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: ~bvadd32(4bv32, cast_~#y~0!offset) }, 4bv32); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~intFLOATTYPE8({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8bv32); [L22] FCALL call cast_#t~mem3 := read~intFLOATTYPE8({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] COND TRUE 0bv32 == __VERIFIER_assert_~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [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; [L33] r = cast(a) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() ----- [2018-11-23 12:39:32,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:39:32 ImpRootNode [2018-11-23 12:39:32,286 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 12:39:32,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:39:32,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:39:32,286 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:39:32,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:39:31" (3/4) ... [2018-11-23 12:39:32,288 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet4;havoc main_#t~nondet4;assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32);cast_#in~i := main_~a~0;havoc cast_#res;havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset;cast_~i := cast_#in~i;call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32);call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32);call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32);call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32);call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32);havoc cast_#t~mem0;call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32);call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32);call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32);havoc cast_#t~mem1;call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32);call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32);cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3);havoc cast_#t~mem2;havoc cast_#t~mem3;call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset);havoc cast_~#x~0.base, cast_~#x~0.offset;call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset);havoc cast_~#y~0.base, cast_~#y~0.offset;main_#t~ret5 := cast_#res;main_~r~0 := main_#t~ret5;havoc main_#t~ret5;__VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] assume 0bv32 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=#x00000000, ULTIMATE.start_cast_~i=#xffffd8f0, ULTIMATE.start_main_~a~0=#xffffd8f0, ULTIMATE.start_main_~r~0=(_ NaN 11 53), |#NULL.base|=#x00000000, |#NULL.offset|=#x00000000, |ULTIMATE.start___VERIFIER_assert_#in~cond|=#x00000000, |ULTIMATE.start_cast_#in~i|=#xffffd8f0, |ULTIMATE.start_cast_#res|=(_ NaN 11 53)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32); [L19] havoc cast_#t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32); [L22] call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assume 0bv32 == __VERIFIER_assert_~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0.base, cast_~#x~0.offset, cast_~#y~0.base, cast_~#y~0.offset; [L15-L23] cast_~i := cast_#in~i; [L17] call cast_~#x~0.base, cast_~#x~0.offset := #Ultimate.alloc(8bv32); [L17] call cast_~#y~0.base, cast_~#y~0.offset := #Ultimate.alloc(8bv32); [L18] call write~intINTTYPE4(1127219200bv32, cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call cast_#t~mem0 := read~intINTTYPE4(cast_~#x~0.base, cast_~#x~0.offset, 4bv32); [L19] call write~intINTTYPE4(cast_#t~mem0, cast_~#y~0.base, cast_~#y~0.offset, 4bv32); [L19] havoc cast_#t~mem0; [L20] call write~intINTTYPE4(2147483648bv32, cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call cast_#t~mem1 := read~intINTTYPE4(cast_~#x~0.base, ~bvadd32(4bv32, cast_~#x~0.offset), 4bv32); [L21] call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), cast_~#y~0.base, ~bvadd32(4bv32, cast_~#y~0.offset), 4bv32); [L21] havoc cast_#t~mem1; [L22] call cast_#t~mem2 := read~intFLOATTYPE8(cast_~#y~0.base, cast_~#y~0.offset, 8bv32); [L22] call cast_#t~mem3 := read~intFLOATTYPE8(cast_~#x~0.base, cast_~#x~0.offset, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] call ULTIMATE.dealloc(cast_~#x~0.base, cast_~#x~0.offset); [L22] havoc cast_~#x~0.base, cast_~#x~0.offset; [L17] call ULTIMATE.dealloc(cast_~#y~0.base, cast_~#y~0.offset); [L22] havoc cast_~#y~0.base, cast_~#y~0.offset; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assume 0bv32 == __VERIFIER_assert_~cond; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call cast_#t~mem0 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4bv32); [L19] havoc cast_#t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call cast_#t~mem1 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: ~bvadd32(4bv32, cast_~#y~0!offset) }, 4bv32); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~intFLOATTYPE8({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8bv32); [L22] FCALL call cast_#t~mem3 := read~intFLOATTYPE8({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] COND TRUE 0bv32 == __VERIFIER_assert_~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L27] havoc main_~a~0; [L28] havoc main_~r~0; [L30] main_~a~0 := main_#t~nondet4; [L30] havoc main_#t~nondet4; [L31] assume 0bv32 != (if ~bvsge32(main_~a~0, 4294957296bv32) && ~bvsle32(main_~a~0, 10000bv32) then 1bv32 else 0bv32); [L33] cast_#in~i := main_~a~0; [L33] havoc cast_#res; [L33] havoc cast_#t~mem0, cast_#t~mem1, cast_#t~mem2, cast_#t~mem3, cast_~i, cast_~#x~0, cast_~#y~0; [L15-L23] cast_~i := cast_#in~i; [L17] FCALL call cast_~#x~0 := #Ultimate.alloc(8bv32); [L17] FCALL call cast_~#y~0 := #Ultimate.alloc(8bv32); [L18] FCALL call write~intINTTYPE4(1127219200bv32, { base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call cast_#t~mem0 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 4bv32); [L19] FCALL call write~intINTTYPE4(cast_#t~mem0, { base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 4bv32); [L19] havoc cast_#t~mem0; [L20] FCALL call write~intINTTYPE4(2147483648bv32, { base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call cast_#t~mem1 := read~intINTTYPE4({ base: cast_~#x~0!base, offset: ~bvadd32(4bv32, cast_~#x~0!offset) }, 4bv32); [L21] FCALL call write~intINTTYPE4(~bvxor32(cast_~i, cast_#t~mem1), { base: cast_~#y~0!base, offset: ~bvadd32(4bv32, cast_~#y~0!offset) }, 4bv32); [L21] havoc cast_#t~mem1; [L22] FCALL call cast_#t~mem2 := read~intFLOATTYPE8({ base: cast_~#y~0!base, offset: cast_~#y~0!offset }, 8bv32); [L22] FCALL call cast_#t~mem3 := read~intFLOATTYPE8({ base: cast_~#x~0!base, offset: cast_~#x~0!offset }, 8bv32); [L22] cast_#res := ~fp.sub~DOUBLE(~roundNearestTiesToEven, cast_#t~mem2, cast_#t~mem3); [L22] havoc cast_#t~mem2; [L22] havoc cast_#t~mem3; [L17] FCALL call ULTIMATE.dealloc(cast_~#x~0); [L22] havoc cast_~#x~0; [L17] FCALL call ULTIMATE.dealloc(cast_~#y~0); [L22] havoc cast_~#y~0; [L33] main_#t~ret5 := cast_#res; [L33] main_~r~0 := main_#t~ret5; [L33] havoc main_#t~ret5; [L34] __VERIFIER_assert_#in~cond := (if ~fp.geq~DOUBLE(main_~r~0, ~fp.neg~DOUBLE(~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0))) && ~fp.leq~DOUBLE(main_~r~0, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10000.0)) then 1bv32 else 0bv32); [L34] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] COND TRUE 0bv32 == __VERIFIER_assert_~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, __VERIFIER_assert_#in~cond=0bv32, __VERIFIER_assert_~cond=0bv32, cast_#in~i=4294957296bv32, cast_#res=~NaN~LONGDOUBLE(), cast_~i=4294957296bv32, main_~a~0=4294957296bv32, main_~r~0=~NaN~LONGDOUBLE()] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [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); [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~mem2; [L22] havoc #t~mem3; [L17] FCALL call ULTIMATE.dealloc(~#x~0); [L22] havoc ~#x~0; [L17] FCALL call ULTIMATE.dealloc(~#y~0); [L22] havoc ~#y~0; [L33] ~r~0 := #t~ret5; [L33] havoc #t~ret5; [L8] ~cond := #in~cond; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L8] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L27] int a; [L28] double r; [L30] a = __VERIFIER_nondet_int() [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; [L33] r = cast(a) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() ----- [2018-11-23 12:39:32,324 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d4922c62-2b06-4db2-9388-314e4d7c438f/bin-2019/ukojak/witness.graphml [2018-11-23 12:39:32,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:39:32,325 INFO L168 Benchmark]: Toolchain (without parser) took 1567.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:32,326 INFO L168 Benchmark]: CDTParser took 0.18 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 12:39:32,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.82 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 931.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:32,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.87 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:32,327 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:39:32,327 INFO L168 Benchmark]: RCFGBuilder took 882.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:32,328 INFO L168 Benchmark]: CodeCheck took 350.93 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:32,329 INFO L168 Benchmark]: Witness Printer took 38.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:39:32,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - 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() [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; [L33] r = cast(a) [L8] COND TRUE !(cond) [L8] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 229.82 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 931.7 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.87 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.0 GB. Free memory is still 931.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 882.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * CodeCheck took 350.93 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...