./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/stroeder1_unsafe_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/stroeder1_unsafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c090728bcdd499bfd732daec58c15cc1b5f2f2aa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:09:13,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:09:13,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:09:13,277 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:09:13,277 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:09:13,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:09:13,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:09:13,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:09:13,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:09:13,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:09:13,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:09:13,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:09:13,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:09:13,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:09:13,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:09:13,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:09:13,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:09:13,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:09:13,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:09:13,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:09:13,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:09:13,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:09:13,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:09:13,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:09:13,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:09:13,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:09:13,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:09:13,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:09:13,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:09:13,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:09:13,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:09:13,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:09:13,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:09:13,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:09:13,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:09:13,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:09:13,298 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-22 23:09:13,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:09:13,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:09:13,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:09:13,308 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:09:13,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:09:13,308 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:09:13,308 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:09:13,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:09:13,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:09:13,309 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 23:09:13,309 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 23:09:13,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:09:13,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:09:13,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 23:09:13,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:09:13,310 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:09:13,310 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-22 23:09:13,310 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:09:13,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_4d794f84-5784-4c33-acc9-dcf25063fe5c/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c090728bcdd499bfd732daec58c15cc1b5f2f2aa [2018-11-22 23:09:13,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:09:13,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:09:13,342 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:09:13,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:09:13,343 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:09:13,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/../../sv-benchmarks/c/array-memsafety/stroeder1_unsafe_false-valid-deref.i [2018-11-22 23:09:13,378 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/data/2b33a79f8/bf1de070050548f39cd5c57130fc071d/FLAG632381058 [2018-11-22 23:09:13,698 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:09:13,698 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/sv-benchmarks/c/array-memsafety/stroeder1_unsafe_false-valid-deref.i [2018-11-22 23:09:13,704 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/data/2b33a79f8/bf1de070050548f39cd5c57130fc071d/FLAG632381058 [2018-11-22 23:09:13,713 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/data/2b33a79f8/bf1de070050548f39cd5c57130fc071d [2018-11-22 23:09:13,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:09:13,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:09:13,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:09:13,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:09:13,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:09:13,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9989bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13, skipping insertion in model container [2018-11-22 23:09:13,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:09:13,748 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:09:13,882 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:09:13,889 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:09:13,898 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:09:13,906 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:09:13,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13 WrapperNode [2018-11-22 23:09:13,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:09:13,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:09:13,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:09:13,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:09:13,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:09:13,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:09:13,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:09:13,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:09:13,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... [2018-11-22 23:09:13,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:09:13,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:09:13,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:09:13,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:09:13,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:09:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 23:09:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:09:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:09:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:09:14,153 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:09:14,153 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 23:09:14,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:14 BoogieIcfgContainer [2018-11-22 23:09:14,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:09:14,154 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 23:09:14,154 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 23:09:14,160 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 23:09:14,160 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:14" (1/1) ... [2018-11-22 23:09:14,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:09:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:09:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-11-22 23:09:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-11-22 23:09:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-22 23:09:14,190 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:09:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:09:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:09:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 23:09:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 10 states and 11 transitions. [2018-11-22 23:09:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-11-22 23:09:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-22 23:09:14,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 23:09:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:09:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:09:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:09:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:09:14,355 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc main_~numbers~0.base, main_~numbers~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~array_size~0 := main_#t~nondet2;havoc main_#t~nondet2;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~p~0.base=2, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] assume !(1 == #valid[sumOfThirdBytes_~p~0.base]); VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~p~0.base=2, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L15] havoc main_~numbers~0.base, main_~numbers~0.offset; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L2-L13] sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size); [L8] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0; [L9] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [L10] call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L15] havoc main_~numbers~0.base, main_~numbers~0.offset; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L2-L13] sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size); [L8] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0; [L9] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [L10] call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0, main_~array_size~0; [L15] havoc main_~numbers~0; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers, sumOfThirdBytes_#in~array_size := main_~numbers~0, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0; [L2-L13] sumOfThirdBytes_~#numbers := sumOfThirdBytes_#in~numbers; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] COND FALSE !(!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size)) [L8] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~#numbers!base, offset: sumOfThirdBytes_~#numbers!offset + 4 * sumOfThirdBytes_~i~0 }; [L9] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~p~0!base, offset: 2 + sumOfThirdBytes_~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [L10] FCALL call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0, main_~array_size~0; [L15] havoc main_~numbers~0; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers, sumOfThirdBytes_#in~array_size := main_~numbers~0, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0; [L2-L13] sumOfThirdBytes_~#numbers := sumOfThirdBytes_#in~numbers; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] COND FALSE !(!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size)) [L8] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~#numbers!base, offset: sumOfThirdBytes_~#numbers!offset + 4 * sumOfThirdBytes_~i~0 }; [L9] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~p~0!base, offset: 2 + sumOfThirdBytes_~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [L10] FCALL call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] havoc ~numbers~0; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] ~array_size~0 := #t~nondet2; [L16] havoc #t~nondet2; [L2-L13] ~#numbers := #in~numbers; [L2-L13] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~sum~0; [L5] havoc ~p~0; [L6] ~sum~0 := 0; [L7] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L7-L11] COND FALSE !(!(~i~0 < ~array_size)) [L8] ~p~0 := { base: ~#numbers!base, offset: ~#numbers!offset + 4 * ~i~0 }; [L9] ~p~0 := { base: ~p~0!base, offset: 2 + ~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~mem1 := read~int(~p~0, 1); [?] requires 1 == #valid[#ptr.base]; 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; [L15] havoc ~numbers~0; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] ~array_size~0 := #t~nondet2; [L16] havoc #t~nondet2; [L2-L13] ~#numbers := #in~numbers; [L2-L13] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~sum~0; [L5] havoc ~p~0; [L6] ~sum~0 := 0; [L7] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L7-L11] COND FALSE !(!(~i~0 < ~array_size)) [L8] ~p~0 := { base: ~#numbers!base, offset: ~#numbers!offset + 4 * ~i~0 }; [L9] ~p~0 := { base: ~p~0!base, offset: 2 + ~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~mem1 := read~int(~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L15] int* numbers; [L16] int array_size = __VERIFIER_nondet_int(); [L4] int i, sum; [L5] char* p; [L6] sum = 0 [L7] i = 0 [L7] COND TRUE i < array_size [L8] p = &(numbers[i]) [L9] p = p + 2 [L10] \read(*p) ----- [2018-11-22 23:09:14,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:09:14 ImpRootNode [2018-11-22 23:09:14,380 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 23:09:14,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:09:14,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:09:14,380 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:09:14,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:09:14" (3/4) ... [2018-11-22 23:09:14,383 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc main_~numbers~0.base, main_~numbers~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~array_size~0 := main_#t~nondet2;havoc main_#t~nondet2;sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sumOfThirdBytes_#res;havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset;sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size;havoc sumOfThirdBytes_~i~0;havoc sumOfThirdBytes_~sum~0;havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset;sumOfThirdBytes_~sum~0 := 0;sumOfThirdBytes_~i~0 := 0; VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size);sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0;sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~p~0.base=2, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] assume !(1 == #valid[sumOfThirdBytes_~p~0.base]); VAL [ULTIMATE.start_main_~array_size~0=1, ULTIMATE.start_main_~numbers~0.base=2, ULTIMATE.start_main_~numbers~0.offset=(- 2), ULTIMATE.start_sumOfThirdBytes_~array_size=1, ULTIMATE.start_sumOfThirdBytes_~i~0=0, ULTIMATE.start_sumOfThirdBytes_~p~0.base=2, ULTIMATE.start_sumOfThirdBytes_~p~0.offset=0, ULTIMATE.start_sumOfThirdBytes_~sum~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_sumOfThirdBytes_#in~array_size|=1, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_#in~numbers.offset|=(- 2), |ULTIMATE.start_sumOfThirdBytes_~#numbers.base|=2, |ULTIMATE.start_sumOfThirdBytes_~#numbers.offset|=(- 2)] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L15] havoc main_~numbers~0.base, main_~numbers~0.offset; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L2-L13] sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size); [L8] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0; [L9] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [L10] call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L15] havoc main_~numbers~0.base, main_~numbers~0.offset; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset, sumOfThirdBytes_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L2-L13] sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset := sumOfThirdBytes_#in~numbers.base, sumOfThirdBytes_#in~numbers.offset; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] assume !!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size); [L8] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~#numbers.base, sumOfThirdBytes_~#numbers.offset + 4 * sumOfThirdBytes_~i~0; [L9] sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset := sumOfThirdBytes_~p~0.base, 2 + sumOfThirdBytes_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [L10] call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0.base, sumOfThirdBytes_~p~0.offset, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~array_size~0=1, main_~numbers~0.base=2, main_~numbers~0.offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers.base=2, sumOfThirdBytes_#in~numbers.offset=-2, sumOfThirdBytes_~#numbers.base=2, sumOfThirdBytes_~#numbers.offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0.base=2, sumOfThirdBytes_~p~0.offset=0, sumOfThirdBytes_~sum~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0, main_~array_size~0; [L15] havoc main_~numbers~0; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers, sumOfThirdBytes_#in~array_size := main_~numbers~0, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0; [L2-L13] sumOfThirdBytes_~#numbers := sumOfThirdBytes_#in~numbers; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] COND FALSE !(!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size)) [L8] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~#numbers!base, offset: sumOfThirdBytes_~#numbers!offset + 4 * sumOfThirdBytes_~i~0 }; [L9] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~p~0!base, offset: 2 + sumOfThirdBytes_~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [L10] FCALL call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~numbers~0, main_~array_size~0; [L15] havoc main_~numbers~0; [L16] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L16] main_~array_size~0 := main_#t~nondet2; [L16] havoc main_#t~nondet2; [L17] sumOfThirdBytes_#in~numbers, sumOfThirdBytes_#in~array_size := main_~numbers~0, main_~array_size~0; [L17] havoc sumOfThirdBytes_#res; [L17] havoc sumOfThirdBytes_#t~mem1, sumOfThirdBytes_#t~post0, sumOfThirdBytes_~#numbers, sumOfThirdBytes_~array_size, sumOfThirdBytes_~i~0, sumOfThirdBytes_~sum~0, sumOfThirdBytes_~p~0; [L2-L13] sumOfThirdBytes_~#numbers := sumOfThirdBytes_#in~numbers; [L2-L13] sumOfThirdBytes_~array_size := sumOfThirdBytes_#in~array_size; [L4] havoc sumOfThirdBytes_~i~0; [L4] havoc sumOfThirdBytes_~sum~0; [L5] havoc sumOfThirdBytes_~p~0; [L6] sumOfThirdBytes_~sum~0 := 0; [L7] sumOfThirdBytes_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~sum~0=0] [L7-L11] COND FALSE !(!(sumOfThirdBytes_~i~0 < sumOfThirdBytes_~array_size)) [L8] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~#numbers!base, offset: sumOfThirdBytes_~#numbers!offset + 4 * sumOfThirdBytes_~i~0 }; [L9] sumOfThirdBytes_~p~0 := { base: sumOfThirdBytes_~p~0!base, offset: 2 + sumOfThirdBytes_~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [L10] FCALL call sumOfThirdBytes_#t~mem1 := read~int(sumOfThirdBytes_~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~array_size~0=1, main_~numbers~0!base=2, main_~numbers~0!offset=-2, sumOfThirdBytes_#in~array_size=1, sumOfThirdBytes_#in~numbers!base=2, sumOfThirdBytes_#in~numbers!offset=-2, sumOfThirdBytes_~#numbers!base=2, sumOfThirdBytes_~#numbers!offset=-2, sumOfThirdBytes_~array_size=1, sumOfThirdBytes_~i~0=0, sumOfThirdBytes_~p~0!base=2, sumOfThirdBytes_~p~0!offset=0, sumOfThirdBytes_~sum~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] havoc ~numbers~0; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] ~array_size~0 := #t~nondet2; [L16] havoc #t~nondet2; [L2-L13] ~#numbers := #in~numbers; [L2-L13] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~sum~0; [L5] havoc ~p~0; [L6] ~sum~0 := 0; [L7] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L7-L11] COND FALSE !(!(~i~0 < ~array_size)) [L8] ~p~0 := { base: ~#numbers!base, offset: ~#numbers!offset + 4 * ~i~0 }; [L9] ~p~0 := { base: ~p~0!base, offset: 2 + ~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~mem1 := read~int(~p~0, 1); [?] requires 1 == #valid[#ptr.base]; 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; [L15] havoc ~numbers~0; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] ~array_size~0 := #t~nondet2; [L16] havoc #t~nondet2; [L2-L13] ~#numbers := #in~numbers; [L2-L13] ~array_size := #in~array_size; [L4] havoc ~i~0; [L4] havoc ~sum~0; [L5] havoc ~p~0; [L6] ~sum~0 := 0; [L7] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L7-L11] COND FALSE !(!(~i~0 < ~array_size)) [L8] ~p~0 := { base: ~#numbers!base, offset: ~#numbers!offset + 4 * ~i~0 }; [L9] ~p~0 := { base: ~p~0!base, offset: 2 + ~p~0!offset }; VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~mem1 := read~int(~p~0, 1); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L15] int* numbers; [L16] int array_size = __VERIFIER_nondet_int(); [L4] int i, sum; [L5] char* p; [L6] sum = 0 [L7] i = 0 [L7] COND TRUE i < array_size [L8] p = &(numbers[i]) [L9] p = p + 2 [L10] \read(*p) ----- [2018-11-22 23:09:14,416 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4d794f84-5784-4c33-acc9-dcf25063fe5c/bin-2019/ukojak/witness.graphml [2018-11-22 23:09:14,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:09:14,417 INFO L168 Benchmark]: Toolchain (without parser) took 700.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,418 INFO L168 Benchmark]: CDTParser took 0.10 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-22 23:09:14,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.96 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,419 INFO L168 Benchmark]: Boogie Preprocessor took 13.04 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:09:14,419 INFO L168 Benchmark]: RCFGBuilder took 212.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,420 INFO L168 Benchmark]: CodeCheck took 225.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,420 INFO L168 Benchmark]: Witness Printer took 36.54 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-22 23:09:14,423 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, 14 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 2 SDs, 0 SdLazy, 5 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 2 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 10]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L15] int* numbers; [L16] int array_size = __VERIFIER_nondet_int(); [L4] int i, sum; [L5] char* p; [L6] sum = 0 [L7] i = 0 [L7] COND TRUE i < array_size [L8] p = &(numbers[i]) [L9] p = p + 2 [L10] \read(*p) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.96 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.99 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.04 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 212.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * CodeCheck took 225.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Witness Printer took 36.54 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...