./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/scopes3_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_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7efcb16e512d7de15a71f6cd895dcd8493c4b646 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:50,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:20:50,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:20:50,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:20:50,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:20:50,332 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:20:50,333 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:20:50,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:20:50,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:20:50,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:20:50,337 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:20:50,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:20:50,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:20:50,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:20:50,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:20:50,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:20:50,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:20:50,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:20:50,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:20:50,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:20:50,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:20:50,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:20:50,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:20:50,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:20:50,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:20:50,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:20:50,350 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:20:50,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:20:50,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:20:50,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:20:50,353 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:20:50,353 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:20:50,353 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:20:50,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:20:50,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:20:50,355 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:20:50,355 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 13:20:50,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:20:50,366 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:20:50,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:20:50,367 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:20:50,367 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:20:50,367 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:20:50,367 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:20:50,367 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:20:50,367 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:20:50,368 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:20:50,368 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:20:50,368 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:20:50,368 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:20:50,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:20:50,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:20:50,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:20:50,369 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:20:50,369 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:20:50,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:20:50,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:20:50,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:20:50,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:20:50,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan 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 -> Taipan 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 -> 7efcb16e512d7de15a71f6cd895dcd8493c4b646 [2018-11-23 13:20:50,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:20:50,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:20:50,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:20:50,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:20:50,407 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:20:50,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-23 13:20:50,447 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/data/8e3226ee1/aaae9f0640c947738b508fa98e27e935/FLAGfd08b803e [2018-11-23 13:20:50,848 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:20:50,848 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/sv-benchmarks/c/memsafety-ext3/scopes3_false-valid-deref.c [2018-11-23 13:20:50,852 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/data/8e3226ee1/aaae9f0640c947738b508fa98e27e935/FLAGfd08b803e [2018-11-23 13:20:50,861 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/data/8e3226ee1/aaae9f0640c947738b508fa98e27e935 [2018-11-23 13:20:50,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:20:50,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:20:50,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:20:50,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:20:50,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:20:50,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:20:50" (1/1) ... [2018-11-23 13:20:50,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fae5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:50, skipping insertion in model container [2018-11-23 13:20:50,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:20:50" (1/1) ... [2018-11-23 13:20:50,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:20:50,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:20:50,994 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:20:51,001 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:20:51,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:20:51,019 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:20:51,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51 WrapperNode [2018-11-23 13:20:51,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:20:51,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:20:51,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:20:51,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:20:51,025 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:20:51" (1/1) ... [2018-11-23 13:20:51,031 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:20:51" (1/1) ... [2018-11-23 13:20:51,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:20:51,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:20:51,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:20:51,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:20:51,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... [2018-11-23 13:20:51,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:20:51,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:20:51,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:20:51,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:20:51,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:20:51,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:20:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:20:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:20:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:20:51,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:20:51,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:20:51,256 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:20:51,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:20:51 BoogieIcfgContainer [2018-11-23 13:20:51,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:20:51,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:20:51,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:20:51,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:20:51,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:20:50" (1/3) ... [2018-11-23 13:20:51,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a219dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:20:51, skipping insertion in model container [2018-11-23 13:20:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:20:51" (2/3) ... [2018-11-23 13:20:51,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a219dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:20:51, skipping insertion in model container [2018-11-23 13:20:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:20:51" (3/3) ... [2018-11-23 13:20:51,263 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3_false-valid-deref.c [2018-11-23 13:20:51,272 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:20:51,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-23 13:20:51,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-23 13:20:51,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:20:51,319 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 13:20:51,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:20:51,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:20:51,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:20:51,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:20:51,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:20:51,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:20:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:20:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:20:51,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -197094901, now seen corresponding path program 1 times [2018-11-23 13:20:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,439 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:20:51,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:20:51,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:20:51,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:20:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:20:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:20:51,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:20:51,454 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:20:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:51,466 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:20:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:20:51,467 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-23 13:20:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:51,473 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:20:51,474 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:20:51,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:20:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:20:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:20:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:20:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:20:51,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2018-11-23 13:20:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:51,499 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:20:51,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:20:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:20:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:20:51,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,500 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -197095180, now seen corresponding path program 1 times [2018-11-23 13:20:51,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,535 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:20:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:20:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:20:51,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:20:51,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:20:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:20:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,537 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-23 13:20:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:51,555 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:20:51,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:20:51,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:20:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:51,557 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:20:51,557 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:20:51,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:20:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-11-23 13:20:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:20:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:20:51,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2018-11-23 13:20:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:51,561 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:20:51,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:20:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:20:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:20:51,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash -197095125, now seen corresponding path program 1 times [2018-11-23 13:20:51,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,596 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:20:51,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:20:51,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:20:51,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:20:51,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:20:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:20:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,597 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2018-11-23 13:20:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:51,626 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:20:51,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:20:51,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:20:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:51,627 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:20:51,627 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:20:51,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:20:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:20:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:20:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:20:51,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2018-11-23 13:20:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:20:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:20:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:20:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:20:51,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,629 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash -197095126, now seen corresponding path program 1 times [2018-11-23 13:20:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,650 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:20:51,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:20:51,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:20:51,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:20:51,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:20:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:20:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,651 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 13:20:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:51,673 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:20:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:20:51,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 13:20:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:51,674 INFO L225 Difference]: With dead ends: 15 [2018-11-23 13:20:51,674 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:20:51,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:20:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:20:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:20:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:20:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:20:51,676 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2018-11-23 13:20:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:51,676 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:20:51,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:20:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:20:51,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:20:51,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,677 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash -440617163, now seen corresponding path program 1 times [2018-11-23 13:20:51,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,704 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:20:51,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:51,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:51,705 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-11-23 13:20:51,706 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [14], [18], [23], [28], [29], [30] [2018-11-23 13:20:51,728 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 13:20:51,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 13:20:51,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 13:20:51,848 INFO L272 AbstractInterpreter]: Visited 11 different actions 19 times. Merged at 3 different actions 6 times. Never widened. Performed 164 root evaluator evaluations with a maximum evaluation depth of 3. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-11-23 13:20:51,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 13:20:51,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:51,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:20:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:51,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:51,904 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:20:51,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:51,948 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:20:51,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:51,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 13:20:51,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:51,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:20:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:20:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:20:51,964 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:20:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:51,975 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:20:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:20:51,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:20:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:51,976 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:20:51,976 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:20:51,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:20:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:20:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-23 13:20:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:20:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:20:51,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2018-11-23 13:20:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:51,978 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:20:51,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:20:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:20:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:20:51,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:51,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:51,979 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:51,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1004249772, now seen corresponding path program 2 times [2018-11-23 13:20:51,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:51,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:51,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:52,018 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:52,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:20:52,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:20:52,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:20:52,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:52,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 13:20:52,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:52,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:20:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:20:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:20:52,130 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-23 13:20:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:52,143 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:20:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:20:52,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:20:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:52,144 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:20:52,144 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:20:52,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:20:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:20:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 13:20:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:20:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:20:52,146 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 13:20:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:52,147 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:20:52,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:20:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:20:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:20:52,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:52,147 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:52,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:52,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1138822869, now seen corresponding path program 3 times [2018-11-23 13:20:52,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:52,193 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:52,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:52,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:20:52,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 13:20:52,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:20:52,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:52,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:52,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 13:20:52,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:52,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:20:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:20:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:20:52,316 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-11-23 13:20:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:52,331 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:20:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:20:52,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-23 13:20:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:52,332 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:20:52,332 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:20:52,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:20:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:20:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 13:20:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:20:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:20:52,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2018-11-23 13:20:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:52,335 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:20:52,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:20:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:20:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:20:52,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:52,336 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:52,336 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:52,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 727015860, now seen corresponding path program 4 times [2018-11-23 13:20:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:52,380 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:52,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:52,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:52,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:20:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:52,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 13:20:52,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:52,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:20:52,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:20:52,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:52,511 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-11-23 13:20:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:52,530 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:20:52,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:20:52,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:20:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:52,531 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:20:52,531 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:20:52,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:20:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 13:20:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:20:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:20:52,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2018-11-23 13:20:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:52,534 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:20:52,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:20:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:20:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:20:52,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:52,535 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:52,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:52,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -988991883, now seen corresponding path program 5 times [2018-11-23 13:20:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:52,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:52,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:52,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:20:52,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:20:52,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:20:52,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:52,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 13:20:52,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:52,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:20:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:20:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:52,740 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2018-11-23 13:20:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:52,758 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:20:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:20:52,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 13:20:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:52,759 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:20:52,759 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:20:52,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:20:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 13:20:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:20:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:20:52,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2018-11-23 13:20:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:52,763 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:20:52,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:20:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:20:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:20:52,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:52,764 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:52,764 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:52,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 420060692, now seen corresponding path program 6 times [2018-11-23 13:20:52,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:52,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:52,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:52,851 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:52,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:52,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:52,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:52,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:20:52,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 13:20:52,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:20:52,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:52,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:52,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:53,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 13:20:53,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:53,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:20:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:20:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,020 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-11-23 13:20:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:53,054 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:20:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:20:53,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-23 13:20:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:53,055 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:20:53,055 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:20:53,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:20:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:20:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:20:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:20:53,058 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2018-11-23 13:20:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:53,058 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:20:53,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:20:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:20:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:20:53,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:53,059 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:53,060 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:53,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1505028587, now seen corresponding path program 7 times [2018-11-23 13:20:53,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:53,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:53,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:53,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:53,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:53,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:53,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 13:20:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:53,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:53,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-23 13:20:53,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:53,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:20:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:20:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,265 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2018-11-23 13:20:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:53,286 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:20:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:20:53,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-23 13:20:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:53,287 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:20:53,287 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:20:53,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:20:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 13:20:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:20:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 13:20:53,289 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-11-23 13:20:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:53,289 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 13:20:53,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:20:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:20:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:20:53,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:53,290 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:53,290 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:53,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1141435788, now seen corresponding path program 8 times [2018-11-23 13:20:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:53,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:20:53,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:53,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:53,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:53,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:20:53,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 13:20:53,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:20:53,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:53,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:53,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 13:20:53,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:53,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:20:53,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:20:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,542 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-11-23 13:20:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:53,571 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:20:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:20:53,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 13:20:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:53,572 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:20:53,572 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:20:53,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:20:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 13:20:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:20:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:20:53,575 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2018-11-23 13:20:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:53,575 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:20:53,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:20:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:20:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:20:53,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:53,576 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:53,576 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1255881291, now seen corresponding path program 9 times [2018-11-23 13:20:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:20:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 13:20:53,675 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 13:20:53,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 13:20:53,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:20:53,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:20:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:20:53,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 13:20:53,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:20:53,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:20:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:20:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:20:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:20:53,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 13:20:53,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 13:20:53,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 13:20:53,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:20:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:20:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,803 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 13 states. [2018-11-23 13:20:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:20:53,835 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:20:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:20:53,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-23 13:20:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:20:53,836 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:20:53,836 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:20:53,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:20:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:20:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 13:20:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:20:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 13:20:53,838 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 35 [2018-11-23 13:20:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:20:53,839 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 13:20:53,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:20:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:20:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:20:53,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:20:53,839 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:20:53,840 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:20:53,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:20:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash -497828140, now seen corresponding path program 10 times [2018-11-23 13:20:53,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:20:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:20:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:20:53,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:20:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:20:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:20:53,896 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=50, |#NULL.offset|=42, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 ----- [2018-11-23 13:20:53,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:20:53 BoogieIcfgContainer [2018-11-23 13:20:53,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:20:53,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:20:53,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:20:53,966 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:20:53,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:20:51" (3/4) ... [2018-11-23 13:20:53,972 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=50, |#NULL.offset|=42, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=50, |old(#NULL.offset)|=42] [?] RET #29#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=0, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=45, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=45, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=1, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=43, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=2, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=47, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=47, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=3, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=41, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=41, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=4, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=5, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=48, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=48, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=6, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=46, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=46, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=7, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=44, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=44, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=8, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=49, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=49, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 10);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L6 VAL [main_~i~0=9, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=51, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=10, main_~p~0.base=51, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=50, #NULL.offset=42, old(#NULL.base)=50, old(#NULL.offset)=42] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=50, old(#NULL.offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=45, ~#a~0.offset=0, ~i~0=0, ~p~0.base=45, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=45, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=43, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=2, ~p~0.base=43, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=47, ~#a~0.offset=0, ~i~0=2, ~p~0.base=47, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=3, ~p~0.base=47, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=41, ~#a~0.offset=0, ~i~0=3, ~p~0.base=41, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=4, ~p~0.base=41, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=4, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=5, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=48, ~#a~0.offset=0, ~i~0=5, ~p~0.base=48, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=6, ~p~0.base=48, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=46, ~#a~0.offset=0, ~i~0=6, ~p~0.base=46, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=7, ~p~0.base=46, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=44, ~#a~0.offset=0, ~i~0=7, ~p~0.base=44, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=8, ~p~0.base=44, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=49, ~#a~0.offset=0, ~i~0=8, ~p~0.base=49, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=9, ~p~0.base=49, ~p~0.offset=0] [L3-L7] assume !!(~i~0 < 10); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L5] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L6] call write~int(1, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=51, ~#a~0.offset=0, ~i~0=9, ~p~0.base=51, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L3-L7] assume !(~i~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [L8] call write~int(2, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=10, ~p~0.base=51, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=50, #NULL!offset=42, old(#NULL!base)=50, old(#NULL!offset)=42] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=50, old(#NULL!offset)=42] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=45, ~#a~0!offset=0, ~i~0=0, ~p~0!base=45, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=45, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=43, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=2, ~p~0!base=43, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=47, ~#a~0!offset=0, ~i~0=2, ~p~0!base=47, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=3, ~p~0!base=47, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=41, ~#a~0!offset=0, ~i~0=3, ~p~0!base=41, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=4, ~p~0!base=41, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=4, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=5, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=48, ~#a~0!offset=0, ~i~0=5, ~p~0!base=48, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=6, ~p~0!base=48, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=46, ~#a~0!offset=0, ~i~0=6, ~p~0!base=46, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=7, ~p~0!base=46, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=44, ~#a~0!offset=0, ~i~0=7, ~p~0!base=44, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=8, ~p~0!base=44, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=49, ~#a~0!offset=0, ~i~0=8, ~p~0!base=49, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=9, ~p~0!base=49, ~p~0!offset=0] [L3-L7] COND FALSE !(!(~i~0 < 10)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); [L5] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L6] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=51, ~#a~0!offset=0, ~i~0=9, ~p~0!base=51, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L3-L7] COND TRUE !(~i~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L8] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=10, ~p~0!base=51, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 ----- [2018-11-23 13:20:54,210 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a4beea5-a9c0-47a6-a05b-2eacff911f63/bin-2019/utaipan/witness.graphml [2018-11-23 13:20:54,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:20:54,211 INFO L168 Benchmark]: Toolchain (without parser) took 3347.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:20:54,212 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:20:54,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.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:20:54,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.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:20:54,213 INFO L168 Benchmark]: Boogie Preprocessor took 54.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:20:54,213 INFO L168 Benchmark]: RCFGBuilder took 166.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:20:54,213 INFO L168 Benchmark]: TraceAbstraction took 2708.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.0 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:20:54,214 INFO L168 Benchmark]: Witness Printer took 244.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:20:54,216 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.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 15.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.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 54.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2708.42 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -6.0 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. * Witness Printer took 244.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={45:0}, i=0, p={45:0}] [L6] p[0] = 1 VAL [a={45:0}, i=0, p={45:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={43:0}, i=1, p={43:0}] [L6] p[0] = 1 VAL [a={43:0}, i=1, p={43:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={47:0}, i=2, p={47:0}] [L6] p[0] = 1 VAL [a={47:0}, i=2, p={47:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={41:0}, i=3, p={41:0}] [L6] p[0] = 1 VAL [a={41:0}, i=3, p={41:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=4, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=4, p={51:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={48:0}, i=5, p={48:0}] [L6] p[0] = 1 VAL [a={48:0}, i=5, p={48:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={46:0}, i=6, p={46:0}] [L6] p[0] = 1 VAL [a={46:0}, i=6, p={46:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={44:0}, i=7, p={44:0}] [L6] p[0] = 1 VAL [a={44:0}, i=7, p={44:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={49:0}, i=8, p={49:0}] [L6] p[0] = 1 VAL [a={49:0}, i=8, p={49:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={51:0}, i=9, p={51:0}] [L6] p[0] = 1 VAL [a={51:0}, i=9, p={51:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={51:0}] [L8] p[0] = 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 5 error locations. UNSAFE Result, 2.6s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 123 SDslu, 421 SDs, 0 SdLazy, 187 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 366 SyntacticMatches, 30 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 484 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 622 ConstructedInterpolants, 0 QuantifiedInterpolants, 37230 SizeOfPredicates, 9 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 0/1215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...