./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_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_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/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 44834c55142a76240cb3980fc2bb6f5aeaa27c83 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:51:25,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:51:25,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:51:25,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:51:25,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:51:25,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:51:25,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:51:25,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:51:25,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:51:25,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:51:25,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:51:25,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:51:25,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:51:25,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:51:25,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:51:25,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:51:25,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:51:25,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:51:25,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:51:25,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:51:25,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:51:25,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:51:25,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:51:25,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:51:25,153 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:51:25,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:51:25,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:51:25,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:51:25,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:51:25,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:51:25,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:51:25,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:51:25,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:51:25,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:51:25,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:51:25,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:51:25,160 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 13:51:25,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:51:25,172 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:51:25,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:51:25,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:51:25,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:51:25,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:51:25,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:51:25,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:51:25,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:51:25,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:51:25,176 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:51:25,176 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:51:25,176 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:51:25,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:51:25,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:51:25,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:51:25,177 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:51:25,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:51:25,177 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:51:25,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:51:25,178 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_97d33881-49fc-467d-9caf-19905b668992/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 -> 44834c55142a76240cb3980fc2bb6f5aeaa27c83 [2018-11-23 13:51:25,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:51:25,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:51:25,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:51:25,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:51:25,218 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:51:25,218 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/../../sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-23 13:51:25,260 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/data/a6357f9be/65e1a98725874f3097ca92a239b989a1/FLAGb87774be7 [2018-11-23 13:51:25,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:51:25,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/sv-benchmarks/c/memsafety-ext3/derefAfterFree2_false-valid-deref.c [2018-11-23 13:51:25,606 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/data/a6357f9be/65e1a98725874f3097ca92a239b989a1/FLAGb87774be7 [2018-11-23 13:51:26,021 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/data/a6357f9be/65e1a98725874f3097ca92a239b989a1 [2018-11-23 13:51:26,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:51:26,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:51:26,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:51:26,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:51:26,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:51:26,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f50e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26, skipping insertion in model container [2018-11-23 13:51:26,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:51:26,051 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:51:26,158 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:51:26,164 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:51:26,173 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:51:26,182 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:51:26,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26 WrapperNode [2018-11-23 13:51:26,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:51:26,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:51:26,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:51:26,183 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:51:26,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:51:26,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:51:26,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:51:26,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:51:26,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:51:26,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:51:26,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:51:26,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:51:26,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:51:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/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 13:51:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:51:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:51:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:51:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:51:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:51:26,406 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:51:26,406 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 13:51:26,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:51:26 BoogieIcfgContainer [2018-11-23 13:51:26,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:51:26,407 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:51:26,407 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:51:26,414 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:51:26,414 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:51:26" (1/1) ... [2018-11-23 13:51:26,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:51:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 14 states and 15 transitions. [2018-11-23 13:51:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:51:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 13:51:26,450 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:26,529 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 13:51:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 13:51:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:51:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 13:51:26,563 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:26,595 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 13:51:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-11-23 13:51:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-11-23 13:51:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 13:51:26,678 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:26,741 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 13:51:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 19 states and 25 transitions. [2018-11-23 13:51:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-11-23 13:51:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 13:51:26,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:26,981 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 13:51:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-23 13:51:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-23 13:51:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:51:27,051 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,080 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 13:51:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2018-11-23 13:51:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2018-11-23 13:51:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:51:27,138 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2018-11-23 13:51:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-23 13:51:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:51:27,177 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 28 states and 42 transitions. [2018-11-23 13:51:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2018-11-23 13:51:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:51:27,445 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 29 states and 42 transitions. [2018-11-23 13:51:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2018-11-23 13:51:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:51:27,526 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 30 states and 42 transitions. [2018-11-23 13:51:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2018-11-23 13:51:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:51:27,637 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 32 states and 46 transitions. [2018-11-23 13:51:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-11-23 13:51:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:51:27,738 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 36 states and 56 transitions. [2018-11-23 13:51:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2018-11-23 13:51:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:51:28,360 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 38 states and 63 transitions. [2018-11-23 13:51:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-11-23 13:51:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:51:28,461 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 39 states and 63 transitions. [2018-11-23 13:51:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2018-11-23 13:51:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:51:28,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 42 states and 68 transitions. [2018-11-23 13:51:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2018-11-23 13:51:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:51:28,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:51:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 44 states and 69 transitions. [2018-11-23 13:51:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 69 transitions. [2018-11-23 13:51:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:51:28,961 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 46 states and 74 transitions. [2018-11-23 13:51:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2018-11-23 13:51:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:51:29,085 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 47 states and 74 transitions. [2018-11-23 13:51:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-11-23 13:51:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:29,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 51 states and 85 transitions. [2018-11-23 13:51:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2018-11-23 13:51:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:29,895 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 53 states and 93 transitions. [2018-11-23 13:51:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2018-11-23 13:51:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:30,078 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:51:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-23 13:51:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-23 13:51:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:30,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 58 states and 99 transitions. [2018-11-23 13:51:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 99 transitions. [2018-11-23 13:51:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:30,660 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 59 states and 99 transitions. [2018-11-23 13:51:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 99 transitions. [2018-11-23 13:51:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:30,849 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:51:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 61 states and 100 transitions. [2018-11-23 13:51:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 100 transitions. [2018-11-23 13:51:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:51:31,121 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 64 states and 102 transitions. [2018-11-23 13:51:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 102 transitions. [2018-11-23 13:51:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:51:31,429 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 66 states and 108 transitions. [2018-11-23 13:51:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 108 transitions. [2018-11-23 13:51:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:51:31,573 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 67 states and 108 transitions. [2018-11-23 13:51:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 108 transitions. [2018-11-23 13:51:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:51:31,735 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 68 states and 108 transitions. [2018-11-23 13:51:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2018-11-23 13:51:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:31,877 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 70 states and 116 transitions. [2018-11-23 13:51:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 116 transitions. [2018-11-23 13:51:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:32,036 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:51:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 72 states and 117 transitions. [2018-11-23 13:51:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2018-11-23 13:51:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:32,248 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 76 states and 131 transitions. [2018-11-23 13:51:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 131 transitions. [2018-11-23 13:51:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:33,036 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:51:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 78 states and 132 transitions. [2018-11-23 13:51:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 132 transitions. [2018-11-23 13:51:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:33,305 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 81 states and 134 transitions. [2018-11-23 13:51:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 134 transitions. [2018-11-23 13:51:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:33,620 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 84 states and 137 transitions. [2018-11-23 13:51:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 137 transitions. [2018-11-23 13:51:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:33,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 85 states and 137 transitions. [2018-11-23 13:51:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 137 transitions. [2018-11-23 13:51:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:51:34,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 88 states and 139 transitions. [2018-11-23 13:51:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2018-11-23 13:51:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:51:34,492 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 90 states and 146 transitions. [2018-11-23 13:51:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 146 transitions. [2018-11-23 13:51:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:51:34,702 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 91 states and 146 transitions. [2018-11-23 13:51:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 146 transitions. [2018-11-23 13:51:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:51:34,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 92 states and 146 transitions. [2018-11-23 13:51:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 146 transitions. [2018-11-23 13:51:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:51:35,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 93 states and 146 transitions. [2018-11-23 13:51:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2018-11-23 13:51:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:35,180 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 95 states and 155 transitions. [2018-11-23 13:51:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 155 transitions. [2018-11-23 13:51:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:35,359 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 99 states and 173 transitions. [2018-11-23 13:51:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 173 transitions. [2018-11-23 13:51:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:36,377 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 102 states and 175 transitions. [2018-11-23 13:51:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 175 transitions. [2018-11-23 13:51:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:36,733 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:51:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 104 states and 176 transitions. [2018-11-23 13:51:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 176 transitions. [2018-11-23 13:51:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:37,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 107 states and 179 transitions. [2018-11-23 13:51:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 179 transitions. [2018-11-23 13:51:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:37,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 108 states and 179 transitions. [2018-11-23 13:51:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 179 transitions. [2018-11-23 13:51:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:37,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 111 states and 181 transitions. [2018-11-23 13:51:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 181 transitions. [2018-11-23 13:51:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:51:38,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 114 states and 183 transitions. [2018-11-23 13:51:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 183 transitions. [2018-11-23 13:51:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:51:38,597 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 13:51:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 129 states and 202 transitions. [2018-11-23 13:51:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2018-11-23 13:51:40,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:51:40,321 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 13:51:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 135 states and 206 transitions. [2018-11-23 13:51:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 206 transitions. [2018-11-23 13:51:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:51:40,812 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 13:51:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 137 states and 206 transitions. [2018-11-23 13:51:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 206 transitions. [2018-11-23 13:51:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:51:41,275 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:51:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 136 states and 205 transitions. [2018-11-23 13:51:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2018-11-23 13:51:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:51:41,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:51:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:51:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:51:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 139 states and 216 transitions. [2018-11-23 13:51:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 216 transitions. [2018-11-23 13:51:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:51:42,208 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:51:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:51:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:51:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:51:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:51:42,283 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 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~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40);main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 5 == main_~i~0; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 0 == main_~p~0.offset; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 0 == main_~p~0.base || 1 == #valid[main_~p~0.base];call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[main_~p~0.base]); VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset; [L6] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40); [L6] main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L8] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume 5 == main_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.base || 1 == #valid[main_~p~0.base]; [L11] call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, 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~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset; [L6] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40); [L6] main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L8] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume 5 == main_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.base || 1 == #valid[main_~p~0.base]; [L11] call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~post3, main_~i~0, main_~p~0; [L6] FCALL call main_#t~malloc2 := #Ultimate.alloc(40); [L6] main_~p~0 := main_#t~malloc2; [L8] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND TRUE 5 == main_~i~0 VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!base || 1 == #valid[main_~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(main_~p~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, 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~malloc2, main_#t~post3, main_~i~0, main_~p~0; [L6] FCALL call main_#t~malloc2 := #Ultimate.alloc(40); [L6] main_~p~0 := main_#t~malloc2; [L8] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND TRUE 5 == main_~i~0 VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!base || 1 == #valid[main_~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(main_~p~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 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; [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND TRUE i == 5 [L11] free(p) [L11] free(p) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 ----- [2018-11-23 13:51:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:51:42 ImpRootNode [2018-11-23 13:51:42,366 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:51:42,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:51:42,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:51:42,375 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:51:42,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:51:26" (3/4) ... [2018-11-23 13:51:42,378 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~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40);main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(5 == main_~i~0); VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] SUMMARY for call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); srcloc: L9 VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 5 == main_~i~0; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 0 == main_~p~0.offset; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume 0 == main_~p~0.base || 1 == #valid[main_~p~0.base];call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(main_~i~0 < 10); VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[main_~p~0.base]); VAL [ULTIMATE.start_main_~i~0=6, ULTIMATE.start_main_~p~0.base=7, ULTIMATE.start_main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset; [L6] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40); [L6] main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L8] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume 5 == main_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.base || 1 == #valid[main_~p~0.base]; [L11] call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, 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~malloc2.base, main_#t~malloc2.offset, main_#t~post3, main_~i~0, main_~p~0.base, main_~p~0.offset; [L6] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(40); [L6] main_~p~0.base, main_~p~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset; [L8] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=0, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=1, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=2, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=3, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume !(5 == main_~i~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=4, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L10-L12] assume 5 == main_~i~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L11] assert 0 == main_~p~0.base || 1 == #valid[main_~p~0.base]; [L11] call ULTIMATE.dealloc(main_~p~0.base, main_~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=5, main_~p~0.base=7, main_~p~0.offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L8-L13] assume !!(main_~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [L9] call write~int(1, main_~p~0.base, main_~p~0.offset + 4 * main_~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~i~0=6, main_~p~0.base=7, main_~p~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~malloc2, main_#t~post3, main_~i~0, main_~p~0; [L6] FCALL call main_#t~malloc2 := #Ultimate.alloc(40); [L6] main_~p~0 := main_#t~malloc2; [L8] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND TRUE 5 == main_~i~0 VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!base || 1 == #valid[main_~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(main_~p~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, 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~malloc2, main_#t~post3, main_~i~0, main_~p~0; [L6] FCALL call main_#t~malloc2 := #Ultimate.alloc(40); [L6] main_~p~0 := main_#t~malloc2; [L8] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=0, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=1, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=2, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=3, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND FALSE !(5 == main_~i~0) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=4, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L10] COND TRUE 5 == main_~i~0 VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L11] assert 0 == main_~p~0!base || 1 == #valid[main_~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(main_~p~0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=5, main_~p~0!base=7, main_~p~0!offset=0] [L8] main_#t~post3 := main_~i~0; [L8] main_~i~0 := 1 + main_#t~post3; [L8] havoc main_#t~post3; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L8-L13] COND FALSE !(!(main_~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [L9] FCALL call write~int(1, { base: main_~p~0!base, offset: main_~p~0!offset + 4 * main_~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~i~0=6, main_~p~0!base=7, main_~p~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 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; [L6] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L6] ~p~0 := #t~malloc2; [L8] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND FALSE !(5 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L10] COND TRUE 5 == ~i~0 VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!offset; VAL [#NULL!base=0, #NULL!offset=0] [L11] assert 0 == ~p~0!base || 1 == #valid[~p~0!base]; [L11] FCALL call ULTIMATE.dealloc(~p~0); VAL [#NULL!base=0, #NULL!offset=0] [L8] #t~post3 := ~i~0; [L8] ~i~0 := 1 + #t~post3; [L8] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0] [L8-L13] COND FALSE !(!(~i~0 < 10)) VAL [#NULL!base=0, #NULL!offset=0] [L9] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0] [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND TRUE i == 5 [L11] free(p) [L11] free(p) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 ----- [2018-11-23 13:51:42,469 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_97d33881-49fc-467d-9caf-19905b668992/bin-2019/ukojak/witness.graphml [2018-11-23 13:51:42,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:51:42,470 INFO L168 Benchmark]: Toolchain (without parser) took 16446.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 958.2 MB in the beginning and 899.9 MB in the end (delta: 58.3 MB). Peak memory consumption was 539.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:42,479 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:51:42,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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:51:42,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 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:51:42,480 INFO L168 Benchmark]: Boogie Preprocessor took 12.41 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:51:42,480 INFO L168 Benchmark]: RCFGBuilder took 190.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:42,481 INFO L168 Benchmark]: CodeCheck took 15959.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.1 GB in the beginning and 912.5 MB in the end (delta: 213.5 MB). Peak memory consumption was 548.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:42,481 INFO L168 Benchmark]: Witness Printer took 102.50 ms. Allocated memory is still 1.5 GB. Free memory was 912.5 MB in the beginning and 899.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:51:42,489 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, 17 locations, 5 error locations. UNSAFE Result, 15.8s OverallTime, 53 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -1123481788 SDslu, 67125248 SDs, 0 SdLazy, 1222918918 SolverSat, 466269938 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7829 GetRequests, 6904 SyntacticMatches, 569 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68777 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 122305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 16 PerfectInterpolantSequences, 382/1333 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: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND TRUE i == 5 [L11] free(p) [L11] free(p) [L8] i++ [L8] COND TRUE i < 10 [L9] p[i] = 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.96 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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 20.42 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.41 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * CodeCheck took 15959.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 1.1 GB in the beginning and 912.5 MB in the end (delta: 213.5 MB). Peak memory consumption was 548.5 MB. Max. memory is 11.5 GB. * Witness Printer took 102.50 ms. Allocated memory is still 1.5 GB. Free memory was 912.5 MB in the beginning and 899.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...