./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/recursive_list_true-termination.c_false-unreach-call.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version aa418289
Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/recursive_list_true-termination.c_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d5040117e2eabdebb8b19ac037d1eb680a830cf
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.1.23-aa41828
[2018-11-23 08:11:07,923 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 08:11:07,924 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 08:11:07,930 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 08:11:07,930 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 08:11:07,931 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 08:11:07,931 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 08:11:07,932 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 08:11:07,934 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 08:11:07,934 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 08:11:07,935 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 08:11:07,935 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 08:11:07,935 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 08:11:07,936 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 08:11:07,937 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 08:11:07,937 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 08:11:07,938 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 08:11:07,939 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 08:11:07,940 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 08:11:07,942 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 08:11:07,942 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 08:11:07,943 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 08:11:07,945 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 08:11:07,945 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 08:11:07,945 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 08:11:07,945 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 08:11:07,946 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 08:11:07,947 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 08:11:07,947 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 08:11:07,948 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 08:11:07,948 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 08:11:07,948 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 08:11:07,949 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 08:11:07,949 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 08:11:07,949 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 08:11:07,950 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 08:11:07,950 INFO  L98         SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf
[2018-11-23 08:11:07,959 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 08:11:07,960 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 08:11:07,960 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 08:11:07,960 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 08:11:07,961 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 08:11:07,961 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 08:11:07,961 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 08:11:07,961 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 08:11:07,962 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 08:11:07,963 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 08:11:07,963 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 08:11:07,963 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 08:11:07,963 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 08:11:07,963 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 08:11:07,963 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 08:11:07,964 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 08:11:07,964 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 08:11:07,965 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 08:11:07,965 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 08:11:07,965 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-23 08:11:07,965 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
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_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d5040117e2eabdebb8b19ac037d1eb680a830cf
[2018-11-23 08:11:07,987 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 08:11:07,995 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 08:11:07,997 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 08:11:07,997 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 08:11:07,998 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 08:11:07,998 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/recursive_list_true-termination.c_false-unreach-call.i
[2018-11-23 08:11:08,031 INFO  L221              CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/data/9312ca859/fb510db2df844ecdaa0a4d6104adbf1e/FLAG74243a4f2
[2018-11-23 08:11:08,411 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 08:11:08,411 INFO  L161              CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/sv-benchmarks/c/ldv-regression/recursive_list_true-termination.c_false-unreach-call.i
[2018-11-23 08:11:08,415 INFO  L355              CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/data/9312ca859/fb510db2df844ecdaa0a4d6104adbf1e/FLAG74243a4f2
[2018-11-23 08:11:08,425 INFO  L363              CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/data/9312ca859/fb510db2df844ecdaa0a4d6104adbf1e
[2018-11-23 08:11:08,427 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 08:11:08,428 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 08:11:08,429 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 08:11:08,429 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 08:11:08,431 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 08:11:08,432 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,433 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08, skipping insertion in model container
[2018-11-23 08:11:08,433 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,439 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 08:11:08,450 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 08:11:08,546 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 08:11:08,553 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 08:11:08,563 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 08:11:08,572 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 08:11:08,572 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08 WrapperNode
[2018-11-23 08:11:08,572 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 08:11:08,573 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 08:11:08,573 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 08:11:08,573 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 08:11:08,578 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,583 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,587 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 08:11:08,587 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 08:11:08,587 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 08:11:08,587 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 08:11:08,627 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,627 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,629 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,629 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,636 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,637 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,638 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
[2018-11-23 08:11:08,640 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 08:11:08,641 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 08:11:08,641 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 08:11:08,641 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 08:11:08,642 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (1/1) ...
No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 08:11:08,688 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-11-23 08:11:08,688 INFO  L130     BoogieDeclarations]: Found specification of procedure err
[2018-11-23 08:11:08,688 INFO  L138     BoogieDeclarations]: Found implementation of procedure err
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 08:11:08,689 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure allocate_memory
[2018-11-23 08:11:08,689 INFO  L138     BoogieDeclarations]: Found implementation of procedure allocate_memory
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 08:11:08,689 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 08:11:08,689 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 08:11:08,690 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 08:11:08,690 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2018-11-23 08:11:08,690 INFO  L130     BoogieDeclarations]: Found specification of procedure append
[2018-11-23 08:11:08,690 INFO  L138     BoogieDeclarations]: Found implementation of procedure append
[2018-11-23 08:11:08,690 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-11-23 08:11:08,828 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 08:11:08,828 INFO  L280             CfgBuilder]: Removed 0 assue(true) statements.
[2018-11-23 08:11:08,828 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:08 BoogieIcfgContainer
[2018-11-23 08:11:08,828 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 08:11:08,829 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 08:11:08,829 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 08:11:08,831 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 08:11:08,831 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:11:08" (1/3) ...
[2018-11-23 08:11:08,832 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557a0ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:08, skipping insertion in model container
[2018-11-23 08:11:08,832 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:08" (2/3) ...
[2018-11-23 08:11:08,832 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557a0ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:08, skipping insertion in model container
[2018-11-23 08:11:08,833 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:08" (3/3) ...
[2018-11-23 08:11:08,835 INFO  L112   eAbstractionObserver]: Analyzing ICFG recursive_list_true-termination.c_false-unreach-call.i
[2018-11-23 08:11:08,844 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 08:11:08,850 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 08:11:08,864 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 08:11:08,889 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 08:11:08,890 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 08:11:08,890 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 08:11:08,890 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 08:11:08,890 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 08:11:08,890 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 08:11:08,890 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 08:11:08,890 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 08:11:08,891 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 08:11:08,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states.
[2018-11-23 08:11:08,909 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-11-23 08:11:08,909 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 08:11:08,910 INFO  L402         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 08:11:08,911 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 08:11:08,914 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 08:11:08,915 INFO  L82        PathProgramCache]: Analyzing trace with hash -1107831234, now seen corresponding path program 1 times
[2018-11-23 08:11:08,916 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 08:11:08,916 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 08:11:08,957 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 08:11:08,957 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 08:11:08,957 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 08:11:09,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:11:09,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 08:11:09,093 INFO  L469         BasicCegarLoop]: Counterexample might be feasible
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]  CALL  call ULTIMATE.init();
     VAL   [|#NULL.base|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=14]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~i~0 := 1;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=1]
[?]  RET   #29#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret7 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        havoc ~l~0.base, ~l~0.offset;call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);call write~int(0, ~l~0.base, ~l~0.offset, 4);
     VAL   [main_~l~0.base=11, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, ~i~0=1]
[?]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;~n := #in~n;havoc ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, ~i~0=1]
[?]  CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);#res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=18, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=18, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=18, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=18, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]  RET   #39#return;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#t~ret1.base|=18, |append_#t~ret1.offset|=0, ~i~0=1]
[?]        ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);#res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, append_~new_el~0.base=18, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#res.base|=18, |append_#res.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, append_~new_el~0.base=18, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#res.base|=18, |append_#res.offset|=0, ~i~0=1]
[?]  RET   #33#return;
     VAL   [main_~l~0.base=11, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret2.base|=18, |main_#t~ret2.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;
     VAL   [main_~l~0.base=18, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, ~i~0=1]
[?]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;~n := #in~n;havoc ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, ~i~0=1]
[?]  CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);#res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=23, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=23, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=23, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=23, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]  RET   #39#return;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#t~ret1.base|=23, |append_#t~ret1.offset|=0, ~i~0=1]
[?]        ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);#res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, append_~new_el~0.base=23, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#res.base|=23, |append_#res.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, append_~new_el~0.base=23, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#res.base|=23, |append_#res.offset|=0, ~i~0=1]
[?]  RET   #35#return;
     VAL   [main_~l~0.base=18, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret3.base|=23, |main_#t~ret3.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
     VAL   [main_~l~0.base=23, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4.base|=18, |main_#t~mem4.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~mem6|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        assume 0 == #t~mem6;havoc #t~mem6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~mem5.base, #t~mem5.offset;
     VAL   [main_~l~0.base=23, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call err();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        assume !false;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]


[?]        CALL  call ULTIMATE.init();
           VAL   [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=14]
[?]              #NULL.base, #NULL.offset := 0, 0;
[?]              #valid := #valid[0 := 0];
[L17]            ~i~0 := 1;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]              ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET   call ULTIMATE.init();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[?]        CALL  call #t~ret7 := main();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L37]            havoc ~l~0.base, ~l~0.offset;
[L37]            call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);
[L38]            ~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;
[L39]            call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);
[L40]            call write~int(0, ~l~0.base, ~l~0.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]      CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #t~ret1.base=18, #t~ret1.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L42]      RET   call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret2.base=18, #t~ret2.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]            ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;
[L42]            havoc #t~ret2.base, #t~ret2.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]      CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #t~ret1.base=23, #t~ret1.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L43]      RET   call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret3.base=23, #t~ret3.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]            ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;
[L43]            havoc #t~ret3.base, #t~ret3.offset;
[L48]            call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);
[L48]            call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);
[L48]            call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~mem4.base=18, #t~mem4.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~mem6=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]            assume 0 == #t~mem6;
[L48]            havoc #t~mem6;
[L48]            havoc #t~mem4.base, #t~mem4.offset;
[L48]            havoc #t~mem5.base, #t~mem5.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]      CALL  call err();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L8]             assert false;
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]        CALL  call ULTIMATE.init();
           VAL   [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=14]
[?]              #NULL.base, #NULL.offset := 0, 0;
[?]              #valid := #valid[0 := 0];
[L17]            ~i~0 := 1;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]              ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET   call ULTIMATE.init();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[?]        CALL  call #t~ret7 := main();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L37]            havoc ~l~0.base, ~l~0.offset;
[L37]            call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);
[L38]            ~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;
[L39]            call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);
[L40]            call write~int(0, ~l~0.base, ~l~0.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]      CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #t~ret1.base=18, #t~ret1.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L42]      RET   call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret2.base=18, #t~ret2.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]            ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;
[L42]            havoc #t~ret2.base, #t~ret2.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]      CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #t~ret1.base=23, #t~ret1.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L43]      RET   call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret3.base=23, #t~ret3.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]            ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;
[L43]            havoc #t~ret3.base, #t~ret3.offset;
[L48]            call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);
[L48]            call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);
[L48]            call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~mem4.base=18, #t~mem4.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~mem6=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]            assume 0 == #t~mem6;
[L48]            havoc #t~mem6;
[L48]            havoc #t~mem4.base, #t~mem4.offset;
[L48]            havoc #t~mem5.base, #t~mem5.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]      CALL  call err();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L8]             assert false;
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]


[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]


[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]


[L17]              int i = 1;
       VAL         [\old(i)=14, i=1]
[L37]              struct list *l,m;
[L38]              l = &m
[L39]              l->next = 0
[L40]              l->n = 0
       VAL         [i=1, l={11:0}, m={11:0}]
[L42]  CALL, EXPR  append(l, 1)
       VAL         [\old(n)=1, i=1, l={11:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=1, i=1, l={11:0}, l={11:0}, n=1]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={18:0}, i=1, malloc(8U)={18:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=1, allocate_memory()={18:0}, i=1, l={11:0}, l={11:0}, n=1]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=1, \result={18:0}, i=1, l={11:0}, l={11:0}, n=1, new_el={18:0}]
[L42]  RET, EXPR   append(l, 1)
       VAL         [append(l, 1)={18:0}, i=1, l={11:0}, m={11:0}]
[L42]              l = append(l, 1)
[L43]  CALL, EXPR  append(l, 2)
       VAL         [\old(n)=2, i=1, l={18:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=2, i=1, l={18:0}, l={18:0}, n=2]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={23:0}, i=1, malloc(8U)={23:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=2, allocate_memory()={23:0}, i=1, l={18:0}, l={18:0}, n=2]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=2, \result={23:0}, i=1, l={18:0}, l={18:0}, n=2, new_el={23:0}]
[L43]  RET, EXPR   append(l, 2)
       VAL         [append(l, 2)={23:0}, i=1, l={18:0}, m={11:0}]
[L43]              l = append(l, 2)
[L48]  EXPR        l->next
[L48]  EXPR        l->next->next
[L48]  EXPR        l->next->next->n
       VAL         [i=1, l={23:0}, l->next={18:0}, l->next->next={11:0}, l->next->next->n=0, m={11:0}]
[L48]  COND TRUE   l->next->next->n == 0
[L48]  CALL        err()
       VAL         [i=1]
[L8]               __VERIFIER_error()
       VAL         [i=1]

-----
[2018-11-23 08:11:09,143 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:11:09 BoogieIcfgContainer
[2018-11-23 08:11:09,143 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 08:11:09,143 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 08:11:09,143 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 08:11:09,144 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 08:11:09,144 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:08" (3/4) ...
[2018-11-23 08:11:09,146 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|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=14]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~i~0 := 1;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10, |old(~i~0)|=14, ~i~0=1]
[?]  RET   #29#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret7 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        havoc ~l~0.base, ~l~0.offset;call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);call write~int(0, ~l~0.base, ~l~0.offset, 4);
     VAL   [main_~l~0.base=11, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, ~i~0=1]
[?]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;~n := #in~n;havoc ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, ~i~0=1]
[?]  CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);#res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=18, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=18, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=18, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=18, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]  RET   #39#return;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#t~ret1.base|=18, |append_#t~ret1.offset|=0, ~i~0=1]
[?]        ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);#res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, append_~new_el~0.base=18, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#res.base|=18, |append_#res.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [append_~l.base=11, append_~l.offset=0, append_~n=1, append_~new_el~0.base=18, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=11, |append_#in~l.offset|=0, |append_#in~n|=1, |append_#res.base|=18, |append_#res.offset|=0, ~i~0=1]
[?]  RET   #33#return;
     VAL   [main_~l~0.base=11, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret2.base|=18, |main_#t~ret2.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;havoc #t~ret2.base, #t~ret2.offset;
     VAL   [main_~l~0.base=18, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, ~i~0=1]
[?]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;~n := #in~n;havoc ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, ~i~0=1]
[?]  CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);#res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=23, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=23, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |allocate_memory_#res.base|=23, |allocate_memory_#res.offset|=0, |allocate_memory_#t~malloc0.base|=23, |allocate_memory_#t~malloc0.offset|=0, ~i~0=1]
[?]  RET   #39#return;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#t~ret1.base|=23, |append_#t~ret1.offset|=0, ~i~0=1]
[?]        ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);#res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, append_~new_el~0.base=23, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#res.base|=23, |append_#res.offset|=0, ~i~0=1]
[?]        assume true;
     VAL   [append_~l.base=18, append_~l.offset=0, append_~n=2, append_~new_el~0.base=23, append_~new_el~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |append_#in~l.base|=18, |append_#in~l.offset|=0, |append_#in~n|=2, |append_#res.base|=23, |append_#res.offset|=0, ~i~0=1]
[?]  RET   #35#return;
     VAL   [main_~l~0.base=18, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret3.base|=23, |main_#t~ret3.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
     VAL   [main_~l~0.base=23, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4.base|=18, |main_#t~mem4.offset|=0, |main_#t~mem5.base|=11, |main_#t~mem5.offset|=0, |main_#t~mem6|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]        assume 0 == #t~mem6;havoc #t~mem6;havoc #t~mem4.base, #t~mem4.offset;havoc #t~mem5.base, #t~mem5.offset;
     VAL   [main_~l~0.base=23, main_~l~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=11, |main_~#m~0.offset|=0, ~i~0=1]
[?]  CALL  call err();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]
[?]        assume !false;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, ~i~0=1]


[?]        CALL  call ULTIMATE.init();
           VAL   [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=14]
[?]              #NULL.base, #NULL.offset := 0, 0;
[?]              #valid := #valid[0 := 0];
[L17]            ~i~0 := 1;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]              ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET   call ULTIMATE.init();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[?]        CALL  call #t~ret7 := main();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L37]            havoc ~l~0.base, ~l~0.offset;
[L37]            call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);
[L38]            ~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;
[L39]            call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);
[L40]            call write~int(0, ~l~0.base, ~l~0.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]      CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #t~ret1.base=18, #t~ret1.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L42]      RET   call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret2.base=18, #t~ret2.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]            ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;
[L42]            havoc #t~ret2.base, #t~ret2.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]      CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #t~ret1.base=23, #t~ret1.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L43]      RET   call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret3.base=23, #t~ret3.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]            ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;
[L43]            havoc #t~ret3.base, #t~ret3.offset;
[L48]            call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);
[L48]            call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);
[L48]            call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~mem4.base=18, #t~mem4.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~mem6=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]            assume 0 == #t~mem6;
[L48]            havoc #t~mem6;
[L48]            havoc #t~mem4.base, #t~mem4.offset;
[L48]            havoc #t~mem5.base, #t~mem5.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]      CALL  call err();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L8]             assert false;
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]        CALL  call ULTIMATE.init();
           VAL   [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=14]
[?]              #NULL.base, #NULL.offset := 0, 0;
[?]              #valid := #valid[0 := 0];
[L17]            ~i~0 := 1;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]              ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET   call ULTIMATE.init();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[?]        CALL  call #t~ret7 := main();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L37]            havoc ~l~0.base, ~l~0.offset;
[L37]            call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(8);
[L38]            ~l~0.base, ~l~0.offset := ~#m~0.base, ~#m~0.offset;
[L39]            call write~$Pointer$(0, 0, ~l~0.base, 4 + ~l~0.offset, 4);
[L40]            call write~int(0, ~l~0.base, ~l~0.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]      CALL  call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, #t~malloc0.base=18, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #t~ret1.base=18, #t~ret1.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=11, #in~l.offset=0, #in~n=1, #NULL.base=0, #NULL.offset=0, #res.base=18, #res.offset=0, ~i~0=1, ~l.base=11, ~l.offset=0, ~n=1, ~new_el~0.base=18, ~new_el~0.offset=0]
[L42]      RET   call #t~ret2.base, #t~ret2.offset := append(~l~0.base, ~l~0.offset, 1);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret2.base=18, #t~ret2.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=11, ~l~0.offset=0]
[L42]            ~l~0.base, ~l~0.offset := #t~ret2.base, #t~ret2.offset;
[L42]            havoc #t~ret2.base, #t~ret2.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]      CALL  call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1]
[L23-L33]        ~l.base, ~l.offset := #in~l.base, #in~l.offset;
[L23-L33]        ~n := #in~n;
[L25]            havoc ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]      CALL  call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L20]            call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L20]            #res.base, #res.offset := #t~malloc0.base, #t~malloc0.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L18-L21]        ensures true;
           VAL   [#NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~i~0=1]
[L27]      RET   call #t~ret1.base, #t~ret1.offset := allocate_memory();
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #t~ret1.base=23, #t~ret1.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2]
[L27]            ~new_el~0.base, ~new_el~0.offset := #t~ret1.base, #t~ret1.offset;
[L27]            havoc #t~ret1.base, #t~ret1.offset;
[L29]            call write~int(~n, ~new_el~0.base, ~new_el~0.offset, 4);
[L30]            call write~$Pointer$(~l.base, ~l.offset, ~new_el~0.base, 4 + ~new_el~0.offset, 4);
[L32]            #res.base, #res.offset := ~new_el~0.base, ~new_el~0.offset;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L23-L33]        ensures true;
           VAL   [#in~l.base=18, #in~l.offset=0, #in~n=2, #NULL.base=0, #NULL.offset=0, #res.base=23, #res.offset=0, ~i~0=1, ~l.base=18, ~l.offset=0, ~n=2, ~new_el~0.base=23, ~new_el~0.offset=0]
[L43]      RET   call #t~ret3.base, #t~ret3.offset := append(~l~0.base, ~l~0.offset, 2);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~ret3.base=23, #t~ret3.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=18, ~l~0.offset=0]
[L43]            ~l~0.base, ~l~0.offset := #t~ret3.base, #t~ret3.offset;
[L43]            havoc #t~ret3.base, #t~ret3.offset;
[L48]            call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~l~0.base, 4 + ~l~0.offset, 4);
[L48]            call #t~mem5.base, #t~mem5.offset := read~$Pointer$(#t~mem4.base, 4 + #t~mem4.offset, 4);
[L48]            call #t~mem6 := read~int(#t~mem5.base, #t~mem5.offset, 4);
           VAL   [#NULL.base=0, #NULL.offset=0, #t~mem4.base=18, #t~mem4.offset=0, #t~mem5.base=11, #t~mem5.offset=0, #t~mem6=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]            assume 0 == #t~mem6;
[L48]            havoc #t~mem6;
[L48]            havoc #t~mem4.base, #t~mem4.offset;
[L48]            havoc #t~mem5.base, #t~mem5.offset;
           VAL   [#NULL.base=0, #NULL.offset=0, ~#m~0.base=11, ~#m~0.offset=0, ~i~0=1, ~l~0.base=23, ~l~0.offset=0]
[L48]      CALL  call err();
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]
[L8]             assert false;
           VAL   [#NULL.base=0, #NULL.offset=0, ~i~0=1]


[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]


[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]        CALL       call ULTIMATE.init();
           VAL        [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=14]
[?]                   #NULL := { base: 0, offset: 0 };
[?]                   #valid[0] := 0;
[L17]                 ~i~0 := 1;
           VAL        [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10, old(~i~0)=14, ~i~0=1]
[?]        RET        call ULTIMATE.init();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[?]        CALL       call #t~ret7 := main();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L37]                 havoc ~l~0;
[L37]      FCALL      call ~#m~0 := #Ultimate.alloc(8);
[L38]                 ~l~0 := ~#m~0;
[L39]      FCALL      call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L40]      FCALL      call write~int(0, { base: ~l~0!base, offset: ~l~0!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]      CALL       call #t~ret2 := append(~l~0, 1);
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, #t~malloc0!base=18, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #t~ret1!base=18, #t~ret1!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=11, #in~l!offset=0, #in~n=1, #NULL!base=0, #NULL!offset=0, #res!base=18, #res!offset=0, ~i~0=1, ~l!base=11, ~l!offset=0, ~n=1, ~new_el~0!base=18, ~new_el~0!offset=0]
[L42]      RET        call #t~ret2 := append(~l~0, 1);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret2!base=18, #t~ret2!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=11, ~l~0!offset=0]
[L42]                 ~l~0 := #t~ret2;
[L42]                 havoc #t~ret2;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]      CALL       call #t~ret3 := append(~l~0, 2);
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1]
[L23-L33]             ~l := #in~l;
[L23-L33]             ~n := #in~n;
[L25]                 havoc ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]      CALL       call #t~ret1 := allocate_memory();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L20]      FCALL      call #t~malloc0 := #Ultimate.alloc(8);
[L20]                 #res := #t~malloc0;
           VAL        [#NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~i~0=1]
[L27]      RET        call #t~ret1 := allocate_memory();
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #t~ret1!base=23, #t~ret1!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2]
[L27]                 ~new_el~0 := #t~ret1;
[L27]                 havoc #t~ret1;
[L29]      FCALL      call write~int(~n, { base: ~new_el~0!base, offset: ~new_el~0!offset }, 4);
[L30]      FCALL      call write~$Pointer$(~l, { base: ~new_el~0!base, offset: 4 + ~new_el~0!offset }, 4);
[L32]                 #res := ~new_el~0;
           VAL        [#in~l!base=18, #in~l!offset=0, #in~n=2, #NULL!base=0, #NULL!offset=0, #res!base=23, #res!offset=0, ~i~0=1, ~l!base=18, ~l!offset=0, ~n=2, ~new_el~0!base=23, ~new_el~0!offset=0]
[L43]      RET        call #t~ret3 := append(~l~0, 2);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~ret3!base=23, #t~ret3!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=18, ~l~0!offset=0]
[L43]                 ~l~0 := #t~ret3;
[L43]                 havoc #t~ret3;
[L48]      FCALL      call #t~mem4 := read~$Pointer$({ base: ~l~0!base, offset: 4 + ~l~0!offset }, 4);
[L48]      FCALL      call #t~mem5 := read~$Pointer$({ base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4);
[L48]      FCALL      call #t~mem6 := read~int({ base: #t~mem5!base, offset: #t~mem5!offset }, 4);
           VAL        [#NULL!base=0, #NULL!offset=0, #t~mem4!base=18, #t~mem4!offset=0, #t~mem5!base=11, #t~mem5!offset=0, #t~mem6=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      COND TRUE  0 == #t~mem6
[L48]                 havoc #t~mem6;
[L48]                 havoc #t~mem4;
[L48]                 havoc #t~mem5;
           VAL        [#NULL!base=0, #NULL!offset=0, ~#m~0!base=11, ~#m~0!offset=0, ~i~0=1, ~l~0!base=23, ~l~0!offset=0]
[L48]      CALL       call err();
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]
[L8]                  assert false;
           VAL        [#NULL!base=0, #NULL!offset=0, ~i~0=1]


[L17]              int i = 1;
       VAL         [\old(i)=14, i=1]
[L37]              struct list *l,m;
[L38]              l = &m
[L39]              l->next = 0
[L40]              l->n = 0
       VAL         [i=1, l={11:0}, m={11:0}]
[L42]  CALL, EXPR  append(l, 1)
       VAL         [\old(n)=1, i=1, l={11:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=1, i=1, l={11:0}, l={11:0}, n=1]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={18:0}, i=1, malloc(8U)={18:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=1, allocate_memory()={18:0}, i=1, l={11:0}, l={11:0}, n=1]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=1, \result={18:0}, i=1, l={11:0}, l={11:0}, n=1, new_el={18:0}]
[L42]  RET, EXPR   append(l, 1)
       VAL         [append(l, 1)={18:0}, i=1, l={11:0}, m={11:0}]
[L42]              l = append(l, 1)
[L43]  CALL, EXPR  append(l, 2)
       VAL         [\old(n)=2, i=1, l={18:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=2, i=1, l={18:0}, l={18:0}, n=2]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={23:0}, i=1, malloc(8U)={23:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=2, allocate_memory()={23:0}, i=1, l={18:0}, l={18:0}, n=2]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=2, \result={23:0}, i=1, l={18:0}, l={18:0}, n=2, new_el={23:0}]
[L43]  RET, EXPR   append(l, 2)
       VAL         [append(l, 2)={23:0}, i=1, l={18:0}, m={11:0}]
[L43]              l = append(l, 2)
[L48]  EXPR        l->next
[L48]  EXPR        l->next->next
[L48]  EXPR        l->next->next->n
       VAL         [i=1, l={23:0}, l->next={18:0}, l->next->next={11:0}, l->next->next->n=0, m={11:0}]
[L48]  COND TRUE   l->next->next->n == 0
[L48]  CALL        err()
       VAL         [i=1]
[L8]               __VERIFIER_error()
       VAL         [i=1]

-----
[2018-11-23 08:11:09,201 INFO  L145         WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c5168621-2a1b-47e7-abf6-5b6b3fc38956/bin-2019/uautomizer/witness.graphml
[2018-11-23 08:11:09,201 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 08:11:09,201 INFO  L168              Benchmark]: Toolchain (without parser) took 773.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,202 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,203 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 143.25 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 945.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,203 INFO  L168              Benchmark]: Boogie Procedure Inliner took 14.49 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,203 INFO  L168              Benchmark]: Boogie Preprocessor took 53.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,204 INFO  L168              Benchmark]: RCFGBuilder took 187.93 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,204 INFO  L168              Benchmark]: TraceAbstraction took 314.20 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,204 INFO  L168              Benchmark]: Witness Printer took 57.64 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.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
[2018-11-23 08:11:09,207 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB.
 * CACSL2BoogieTranslator took 143.25 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 945.8 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 14.49 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB.
 * Boogie Preprocessor took 53.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB.
 * RCFGBuilder took 187.93 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB.
 * TraceAbstraction took 314.20 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB.
 * Witness Printer took 57.64 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.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L17]              int i = 1;
       VAL         [\old(i)=14, i=1]
[L37]              struct list *l,m;
[L38]              l = &m
[L39]              l->next = 0
[L40]              l->n = 0
       VAL         [i=1, l={11:0}, m={11:0}]
[L42]  CALL, EXPR  append(l, 1)
       VAL         [\old(n)=1, i=1, l={11:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=1, i=1, l={11:0}, l={11:0}, n=1]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={18:0}, i=1, malloc(8U)={18:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=1, allocate_memory()={18:0}, i=1, l={11:0}, l={11:0}, n=1]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=1, \result={18:0}, i=1, l={11:0}, l={11:0}, n=1, new_el={18:0}]
[L42]  RET, EXPR   append(l, 1)
       VAL         [append(l, 1)={18:0}, i=1, l={11:0}, m={11:0}]
[L42]              l = append(l, 1)
[L43]  CALL, EXPR  append(l, 2)
       VAL         [\old(n)=2, i=1, l={18:0}]
[L25]              struct list *new_el;
       VAL         [\old(n)=2, i=1, l={18:0}, l={18:0}, n=2]
[L27]  CALL, EXPR  allocate_memory()
       VAL         [i=1]
[L20]              return malloc(8U);
       VAL         [\result={23:0}, i=1, malloc(8U)={23:0}]
[L27]  RET, EXPR   allocate_memory()
       VAL         [\old(n)=2, allocate_memory()={23:0}, i=1, l={18:0}, l={18:0}, n=2]
[L27]              new_el = allocate_memory()
[L29]              new_el->n = n
[L30]              new_el->next = l
[L32]              return new_el;
       VAL         [\old(n)=2, \result={23:0}, i=1, l={18:0}, l={18:0}, n=2, new_el={23:0}]
[L43]  RET, EXPR   append(l, 2)
       VAL         [append(l, 2)={23:0}, i=1, l={18:0}, m={11:0}]
[L43]              l = append(l, 2)
[L48]  EXPR        l->next
[L48]  EXPR        l->next->next
[L48]  EXPR        l->next->next->n
       VAL         [i=1, l={23:0}, l->next={18:0}, l->next->next={11:0}, l->next->next->n=0, m={11:0}]
[L48]  COND TRUE   l->next->next->n == 0
[L48]  CALL        err()
       VAL         [i=1]
[L8]               __VERIFIER_error()
       VAL         [i=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 6 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...