./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_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_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/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 aa3ae4378a5284e50be7191d52900376e96b0fdc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:10:46,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 16:10:46,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 16:10:46,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 16:10:46,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 16:10:46,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 16:10:46,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 16:10:46,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 16:10:46,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 16:10:46,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 16:10:46,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 16:10:46,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 16:10:46,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 16:10:46,028 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 16:10:46,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 16:10:46,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 16:10:46,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 16:10:46,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 16:10:46,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 16:10:46,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 16:10:46,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 16:10:46,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 16:10:46,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 16:10:46,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 16:10:46,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 16:10:46,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 16:10:46,038 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 16:10:46,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 16:10:46,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 16:10:46,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 16:10:46,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 16:10:46,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 16:10:46,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 16:10:46,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 16:10:46,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 16:10:46,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 16:10:46,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 16:10:46,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 16:10:46,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 16:10:46,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 16:10:46,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 16:10:46,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 16:10:46,050 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 16:10:46,051 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 16:10:46,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 16:10:46,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 16:10:46,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 16:10:46,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 16:10:46,052 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 16:10:46,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 16:10:46,052 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_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/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 -> aa3ae4378a5284e50be7191d52900376e96b0fdc [2018-11-23 16:10:46,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 16:10:46,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 16:10:46,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 16:10:46,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 16:10:46,085 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 16:10:46,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c [2018-11-23 16:10:46,130 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/data/cb3468245/c6ff3c0cc0654077a83170d41f1a7f0e/FLAGe4697a1be [2018-11-23 16:10:46,524 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 16:10:46,524 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c [2018-11-23 16:10:46,528 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/data/cb3468245/c6ff3c0cc0654077a83170d41f1a7f0e/FLAGe4697a1be [2018-11-23 16:10:46,538 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/data/cb3468245/c6ff3c0cc0654077a83170d41f1a7f0e [2018-11-23 16:10:46,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 16:10:46,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 16:10:46,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 16:10:46,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 16:10:46,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 16:10:46,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdb4775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46, skipping insertion in model container [2018-11-23 16:10:46,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 16:10:46,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 16:10:46,681 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:10:46,687 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 16:10:46,695 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 16:10:46,705 INFO L195 MainTranslator]: Completed translation [2018-11-23 16:10:46,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46 WrapperNode [2018-11-23 16:10:46,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 16:10:46,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 16:10:46,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 16:10:46,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 16:10:46,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 16:10:46,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 16:10:46,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 16:10:46,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 16:10:46,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 16:10:46,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 16:10:46,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 16:10:46,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 16:10:46,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:10:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 16:10:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 16:10:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 16:10:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 16:10:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 16:10:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 16:10:46,941 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 16:10:46,941 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 16:10:46,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:46 BoogieIcfgContainer [2018-11-23 16:10:46,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 16:10:46,941 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 16:10:46,942 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 16:10:46,948 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 16:10:46,948 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:46" (1/1) ... [2018-11-23 16:10:46,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 16:10:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 16:10:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 10 states and 11 transitions. [2018-11-23 16:10:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-11-23 16:10:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 16:10:46,985 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 16:10:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:10:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:10:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 16:10:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 11 states and 13 transitions. [2018-11-23 16:10:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-11-23 16:10:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 16:10:47,095 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 16:10:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:10:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:10:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 16:10:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 12 states and 13 transitions. [2018-11-23 16:10:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 16:10:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 16:10:47,125 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 16:10:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 16:10:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 16:10:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 16:10:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2018-11-23 16:10:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 16:10:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 16:10:47,201 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 16:10:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:10:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:10:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:10:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 16:10:47,259 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 4 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~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(main_~i~0 < 2);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 0 == main_~i~0;main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset);havoc main_~#a~0.base, main_~#a~0.offset; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(main_~i~0 < 2);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(0 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(1 == #valid[main_~p~0.base]); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset; [L2] havoc main_~p~0.base, main_~p~0.offset; [L3] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0] [L5-L9] assume 0 == main_~i~0; [L6] main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0, main_~p~0.base=3, main_~p~0.offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset); [L4] havoc main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L5-L9] assume !(0 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L8] call write~int(1, main_~p~0.base, main_~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=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~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset; [L2] havoc main_~p~0.base, main_~p~0.offset; [L3] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0] [L5-L9] assume 0 == main_~i~0; [L6] main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0, main_~p~0.base=3, main_~p~0.offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset); [L4] havoc main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L5-L9] assume !(0 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L8] call write~int(1, main_~p~0.base, main_~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~#a~0, main_~p~0; [L2] havoc main_~p~0; [L3] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0] [L5] COND TRUE 0 == main_~i~0 [L6] main_~p~0 := main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0, main_~p~0!base=3, main_~p~0!offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] FCALL call ULTIMATE.dealloc(main_~#a~0); [L4] havoc main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L5] COND FALSE !(0 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L8] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=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~post0, main_~i~0, main_~#a~0, main_~p~0; [L2] havoc main_~p~0; [L3] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0] [L5] COND TRUE 0 == main_~i~0 [L6] main_~p~0 := main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0, main_~p~0!base=3, main_~p~0!offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] FCALL call ULTIMATE.dealloc(main_~#a~0); [L4] havoc main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L5] COND FALSE !(0 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L8] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] 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; [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L2] int* p; [L3] int i = 0; [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND TRUE i == 0 [L6] p = a [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND FALSE !(i == 0) [L8] p[0] = 1 ----- [2018-11-23 16:10:47,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 04:10:47 ImpRootNode [2018-11-23 16:10:47,291 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 16:10:47,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 16:10:47,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 16:10:47,296 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 16:10:47,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:46" (3/4) ... [2018-11-23 16:10:47,298 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~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset;havoc main_~p~0.base, main_~p~0.offset;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(main_~i~0 < 2);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 0 == main_~i~0;main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset);havoc main_~#a~0.base, main_~#a~0.offset; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(main_~i~0 < 2);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(0 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(1 == #valid[main_~p~0.base]); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=3, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset; [L2] havoc main_~p~0.base, main_~p~0.offset; [L3] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0] [L5-L9] assume 0 == main_~i~0; [L6] main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0, main_~p~0.base=3, main_~p~0.offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset); [L4] havoc main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L5-L9] assume !(0 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L8] call write~int(1, main_~p~0.base, main_~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=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~post0, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~p~0.base, main_~p~0.offset; [L2] havoc main_~p~0.base, main_~p~0.offset; [L3] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0] [L5-L9] assume 0 == main_~i~0; [L6] main_~p~0.base, main_~p~0.offset := main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~i~0=0, main_~p~0.base=3, main_~p~0.offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] call ULTIMATE.dealloc(main_~#a~0.base, main_~#a~0.offset); [L4] havoc main_~#a~0.base, main_~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L3-L10] assume !!(main_~i~0 < 2); [L4] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L5-L9] assume !(0 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [L8] call write~int(1, main_~p~0.base, main_~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, main_~p~0.base=3, main_~p~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~post0, main_~i~0, main_~#a~0, main_~p~0; [L2] havoc main_~p~0; [L3] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0] [L5] COND TRUE 0 == main_~i~0 [L6] main_~p~0 := main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0, main_~p~0!base=3, main_~p~0!offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] FCALL call ULTIMATE.dealloc(main_~#a~0); [L4] havoc main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L5] COND FALSE !(0 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L8] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=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~post0, main_~i~0, main_~#a~0, main_~p~0; [L2] havoc main_~p~0; [L3] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0] [L5] COND TRUE 0 == main_~i~0 [L6] main_~p~0 := main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~i~0=0, main_~p~0!base=3, main_~p~0!offset=0] [L3] main_#t~post0 := main_~i~0; [L3] main_~i~0 := 1 + main_#t~post0; [L3] havoc main_#t~post0; [L4] FCALL call ULTIMATE.dealloc(main_~#a~0); [L4] havoc main_~#a~0; VAL [#NULL!base=0, #NULL!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L3-L10] COND FALSE !(!(main_~i~0 < 2)) [L4] FCALL call main_~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L5] COND FALSE !(0 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [L8] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, main_~p~0!base=3, main_~p~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] 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; [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L2] int* p; [L3] int i = 0; [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND TRUE i == 0 [L6] p = a [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND FALSE !(i == 0) [L8] p[0] = 1 ----- [2018-11-23 16:10:47,333 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c613d4f1-d079-4b9b-a6e4-7fa4884467bf/bin-2019/ukojak/witness.graphml [2018-11-23 16:10:47,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 16:10:47,334 INFO L168 Benchmark]: Toolchain (without parser) took 792.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.9 MB in the beginning and 1.1 GB in the end (delta: -121.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,335 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:10:47,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,336 INFO L168 Benchmark]: Boogie Preprocessor took 48.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,336 INFO L168 Benchmark]: RCFGBuilder took 167.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,337 INFO L168 Benchmark]: CodeCheck took 349.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-23 16:10:47,337 INFO L168 Benchmark]: Witness Printer took 41.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 16:10:47,340 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, 13 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 4 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 4 SDs, 0 SdLazy, 58 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND TRUE i == 0 [L6] p = a [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; [L5] COND FALSE !(i == 0) [L8] p[0] = 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.16 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.66 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 167.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * CodeCheck took 349.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 41.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...