./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c --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_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a06ac35b6270d716926f4cab09091bb160bdd736 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-23 13:17:28,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:17:28,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:17:28,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:17:28,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:17:28,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:17:28,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:17:28,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:17:28,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:17:28,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:17:28,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:17:28,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:17:28,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:17:28,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:17:28,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:17:28,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:17:28,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:17:28,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:17:28,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:17:28,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:17:28,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:17:28,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:17:28,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:17:28,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:17:28,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:17:28,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:17:28,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:17:28,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:17:28,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:17:28,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:17:28,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:17:28,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:17:28,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:17:28,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:17:28,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:17:28,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:17:28,274 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 13:17:28,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:17:28,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:17:28,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:17:28,282 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:17:28,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:17:28,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:17:28,282 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:17:28,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:17:28,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:17:28,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:17:28,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:17:28,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:17:28,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:17:28,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:17:28,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:17:28,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:17:28,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:17:28,286 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:17:28,286 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_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a06ac35b6270d716926f4cab09091bb160bdd736 [2018-11-23 13:17:28,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:17:28,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:17:28,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:17:28,318 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:17:28,318 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:17:28,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c [2018-11-23 13:17:28,354 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/data/ba8bf3482/327ddc06a651475798ed0bb2681d28b8/FLAGf3550d802 [2018-11-23 13:17:28,742 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:17:28,742 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/sv-benchmarks/c/memsafety-ext3/scopes2_false-valid-deref.c [2018-11-23 13:17:28,746 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/data/ba8bf3482/327ddc06a651475798ed0bb2681d28b8/FLAGf3550d802 [2018-11-23 13:17:28,756 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/data/ba8bf3482/327ddc06a651475798ed0bb2681d28b8 [2018-11-23 13:17:28,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:17:28,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 13:17:28,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:17:28,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:17:28,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:17:28,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28, skipping insertion in model container [2018-11-23 13:17:28,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:17:28,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:17:28,886 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:17:28,892 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:17:28,901 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:17:28,909 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:17:28,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28 WrapperNode [2018-11-23 13:17:28,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:17:28,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:17:28,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:17:28,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:17:28,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... [2018-11-23 13:17:28,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:17:28,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:17:28,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:17:28,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:17:28,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:17:29,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:17:29,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:17:29,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:17:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-23 13:17:29,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:17:29,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:17:29,162 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:17:29,162 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:17:29,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:29 BoogieIcfgContainer [2018-11-23 13:17:29,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:17:29,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:17:29,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:17:29,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:17:29,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:17:28" (1/3) ... [2018-11-23 13:17:29,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec9923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:29, skipping insertion in model container [2018-11-23 13:17:29,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:28" (2/3) ... [2018-11-23 13:17:29,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec9923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:29, skipping insertion in model container [2018-11-23 13:17:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:29" (3/3) ... [2018-11-23 13:17:29,169 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes2_false-valid-deref.c [2018-11-23 13:17:29,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:17:29,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 13:17:29,197 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 13:17:29,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:17:29,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:17:29,219 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 13:17:29,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:17:29,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:17:29,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:17:29,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:17:29,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:17:29,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:17:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:17:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:17:29,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:29,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:29,242 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:17:29,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash 262489660, now seen corresponding path program 1 times [2018-11-23 13:17:29,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:29,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:17:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:17:29,350 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=105, |#NULL.offset|=101, |#t~string4.base|=106, |#t~string4.offset|=104, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string4.base, #t~string4.offset, 1);call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] RET #23#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=0, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_#t~nondet0|=1] [?] assume 0 != #t~nondet0;havoc #t~nondet0;call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=0, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[~myPointerA~0.base]); VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string4.base=106, #t~string4.offset=104, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [L5] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0; [L6] ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet0=1, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=0, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L8-L13] assume 0 != #t~nondet0; [L8] havoc #t~nondet0; [L10] call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4); [L10] call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4); [L11] ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset; [L10] call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset); [L10] havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L15] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4); [L16] ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [L18] call #t~mem1 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string4.base=106, #t~string4.offset=104, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [L5] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0; [L6] ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet0=1, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=0, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L8-L13] assume 0 != #t~nondet0; [L8] havoc #t~nondet0; [L10] call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4); [L10] call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4); [L11] ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset; [L10] call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset); [L10] havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L15] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4); [L16] ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [L18] call #t~mem1 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string4!base=106, #t~string4!offset=104, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet0=1, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=0, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L8-L13] COND TRUE 0 != #t~nondet0 [L8] havoc #t~nondet0; [L10] FCALL call ~#myNumberA~0 := #Ultimate.alloc(4); [L10] FCALL call write~init~int(7, ~#myNumberA~0, 4); [L11] ~myPointerA~0 := ~#myNumberA~0; [L10] FCALL call ULTIMATE.dealloc(~#myNumberA~0); [L10] havoc ~#myNumberA~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string4!base=106, #t~string4!offset=104, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet0=1, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=0, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L8-L13] COND TRUE 0 != #t~nondet0 [L8] havoc #t~nondet0; [L10] FCALL call ~#myNumberA~0 := #Ultimate.alloc(4); [L10] FCALL call write~init~int(7, ~#myNumberA~0, 4); [L11] ~myPointerA~0 := ~#myNumberA~0; [L10] FCALL call ULTIMATE.dealloc(~#myNumberA~0); [L10] havoc ~#myNumberA~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND TRUE __VERIFIER_nondet_int() [L10] int myNumberA = 7; [L11] myPointerA = &myNumberA [L10] int myNumberA = 7; VAL [myPointerA={102:0}, myPointerB={0:0}] [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB VAL [myNumberB={103:0}, myPointerA={102:0}, myPointerB={103:0}] [L18] \read(*myPointerA) ----- [2018-11-23 13:17:29,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:17:29 BoogieIcfgContainer [2018-11-23 13:17:29,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:17:29,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:17:29,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:17:29,374 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:17:29,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:29" (3/4) ... [2018-11-23 13:17:29,377 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=105, |#NULL.offset|=101, |#t~string4.base|=106, |#t~string4.offset|=104, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string4.base, #t~string4.offset, 1);call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |old(#NULL.base)|=105, |old(#NULL.offset)|=101, |old(#t~string4.base)|=106, |old(#t~string4.offset)|=104] [?] RET #23#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0;~myPointerB~0.base, ~myPointerB~0.offset := 0, 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [main_~myPointerA~0.base=0, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=0, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_#t~nondet0|=1] [?] assume 0 != #t~nondet0;havoc #t~nondet0;call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4);call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4);~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset;call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset);havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=0, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0] [?] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4);call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4);~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0] [?] assume !(1 == #valid[~myPointerA~0.base]); VAL [main_~myPointerA~0.base=102, main_~myPointerA~0.offset=0, main_~myPointerB~0.base=103, main_~myPointerB~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |#t~string4.base|=107, |#t~string4.offset|=0, |main_~#myNumberB~0.base|=103, |main_~#myNumberB~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string4.base=106, #t~string4.offset=104, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [L5] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0; [L6] ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet0=1, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=0, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L8-L13] assume 0 != #t~nondet0; [L8] havoc #t~nondet0; [L10] call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4); [L10] call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4); [L11] ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset; [L10] call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset); [L10] havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L15] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4); [L16] ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [L18] call #t~mem1 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=105, #NULL.offset=101, #t~string4.base=106, #t~string4.offset=104, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L19] call #t~string4.base, #t~string4.offset := #Ultimate.alloc(3); [L19] call write~init~int(37, #t~string4.base, #t~string4.offset, 1); [L19] call write~init~int(100, #t~string4.base, 1 + #t~string4.offset, 1); [L19] call write~init~int(0, #t~string4.base, 2 + #t~string4.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, old(#NULL.base)=105, old(#NULL.offset)=101, old(#t~string4.base)=106, old(#t~string4.offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0] [L5] ~myPointerA~0.base, ~myPointerA~0.offset := 0, 0; [L6] ~myPointerB~0.base, ~myPointerB~0.offset := 0, 0; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet0=1, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=0, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L8-L13] assume 0 != #t~nondet0; [L8] havoc #t~nondet0; [L10] call ~#myNumberA~0.base, ~#myNumberA~0.offset := #Ultimate.alloc(4); [L10] call write~init~int(7, ~#myNumberA~0.base, ~#myNumberA~0.offset, 4); [L11] ~myPointerA~0.base, ~myPointerA~0.offset := ~#myNumberA~0.base, ~#myNumberA~0.offset; [L10] call ULTIMATE.dealloc(~#myNumberA~0.base, ~#myNumberA~0.offset); [L10] havoc ~#myNumberA~0.base, ~#myNumberA~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=0, ~myPointerB~0.offset=0] [L15] call ~#myNumberB~0.base, ~#myNumberB~0.offset := #Ultimate.alloc(4); [L15] call write~init~int(3, ~#myNumberB~0.base, ~#myNumberB~0.offset, 4); [L16] ~myPointerB~0.base, ~myPointerB~0.offset := ~#myNumberB~0.base, ~#myNumberB~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [L18] call #t~mem1 := read~int(~myPointerA~0.base, ~myPointerA~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~string4.base=107, #t~string4.offset=0, ~#myNumberB~0.base=103, ~#myNumberB~0.offset=0, ~myPointerA~0.base=102, ~myPointerA~0.offset=0, ~myPointerB~0.base=103, ~myPointerB~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string4!base=106, #t~string4!offset=104, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet0=1, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=0, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L8-L13] COND TRUE 0 != #t~nondet0 [L8] havoc #t~nondet0; [L10] FCALL call ~#myNumberA~0 := #Ultimate.alloc(4); [L10] FCALL call write~init~int(7, ~#myNumberA~0, 4); [L11] ~myPointerA~0 := ~#myNumberA~0; [L10] FCALL call ULTIMATE.dealloc(~#myNumberA~0); [L10] havoc ~#myNumberA~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=105, #NULL!offset=101, #t~string4!base=106, #t~string4!offset=104, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L19] FCALL call #t~string4 := #Ultimate.alloc(3); [L19] FCALL call write~init~int(37, { base: #t~string4!base, offset: #t~string4!offset }, 1); [L19] FCALL call write~init~int(100, { base: #t~string4!base, offset: 1 + #t~string4!offset }, 1); [L19] FCALL call write~init~int(0, { base: #t~string4!base, offset: 2 + #t~string4!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, old(#NULL!base)=105, old(#NULL!offset)=101, old(#t~string4!base)=106, old(#t~string4!offset)=104] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0] [L5] ~myPointerA~0 := { base: 0, offset: 0 }; [L6] ~myPointerB~0 := { base: 0, offset: 0 }; [L8] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet0=1, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=0, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L8-L13] COND TRUE 0 != #t~nondet0 [L8] havoc #t~nondet0; [L10] FCALL call ~#myNumberA~0 := #Ultimate.alloc(4); [L10] FCALL call write~init~int(7, ~#myNumberA~0, 4); [L11] ~myPointerA~0 := ~#myNumberA~0; [L10] FCALL call ULTIMATE.dealloc(~#myNumberA~0); [L10] havoc ~#myNumberA~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=0, ~myPointerB~0!offset=0] [L15] FCALL call ~#myNumberB~0 := #Ultimate.alloc(4); [L15] FCALL call write~init~int(3, ~#myNumberB~0, 4); [L16] ~myPointerB~0 := ~#myNumberB~0; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L18] FCALL call #t~mem1 := read~int(~myPointerA~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~string4!base=107, #t~string4!offset=0, ~#myNumberB~0!base=103, ~#myNumberB~0!offset=0, ~myPointerA~0!base=102, ~myPointerA~0!offset=0, ~myPointerB~0!base=103, ~myPointerB~0!offset=0] [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND TRUE __VERIFIER_nondet_int() [L10] int myNumberA = 7; [L11] myPointerA = &myNumberA [L10] int myNumberA = 7; VAL [myPointerA={102:0}, myPointerB={0:0}] [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB VAL [myNumberB={103:0}, myPointerA={102:0}, myPointerB={103:0}] [L18] \read(*myPointerA) ----- [2018-11-23 13:17:29,407 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_84377548-f330-4688-a3b7-a154a8d65a92/bin-2019/uautomizer/witness.graphml [2018-11-23 13:17:29,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:17:29,408 INFO L168 Benchmark]: Toolchain (without parser) took 649.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:17:29,409 INFO L168 Benchmark]: CDTParser took 0.11 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 13:17:29,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.53 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:17:29,410 INFO L168 Benchmark]: Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:17:29,411 INFO L168 Benchmark]: RCFGBuilder took 225.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:17:29,411 INFO L168 Benchmark]: TraceAbstraction took 210.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:17:29,412 INFO L168 Benchmark]: Witness Printer took 33.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:17:29,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.53 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 210.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Witness Printer took 33.11 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L5] int *myPointerA = ((void*) 0); [L6] int *myPointerB = ((void*) 0); [L8] COND TRUE __VERIFIER_nondet_int() [L10] int myNumberA = 7; [L11] myPointerA = &myNumberA [L10] int myNumberA = 7; VAL [myPointerA={102:0}, myPointerB={0:0}] [L15] int myNumberB = 3; [L16] myPointerB = &myNumberB VAL [myNumberB={103:0}, myPointerA={102:0}, myPointerB={103:0}] [L18] \read(*myPointerA) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 5 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...