java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i


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


This is Ultimate 0.1.23-61f4311
[2018-11-23 12:55:36,569 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 12:55:36,571 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 12:55:36,583 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 12:55:36,583 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 12:55:36,585 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 12:55:36,586 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 12:55:36,588 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 12:55:36,589 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 12:55:36,590 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 12:55:36,591 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 12:55:36,592 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 12:55:36,593 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 12:55:36,594 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 12:55:36,595 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 12:55:36,596 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 12:55:36,597 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 12:55:36,599 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 12:55:36,601 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 12:55:36,603 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 12:55:36,604 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 12:55:36,605 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 12:55:36,608 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 12:55:36,608 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 12:55:36,608 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 12:55:36,609 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 12:55:36,610 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 12:55:36,611 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 12:55:36,612 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 12:55:36,613 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 12:55:36,614 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 12:55:36,615 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 12:55:36,615 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 12:55:36,615 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 12:55:36,616 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 12:55:36,617 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 12:55:36,617 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2018-11-23 12:55:36,632 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 12:55:36,633 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 12:55:36,634 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 12:55:36,634 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 12:55:36,634 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 12:55:36,635 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 12:55:36,635 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 12:55:36,635 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 12:55:36,635 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 12:55:36,635 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 12:55:36,636 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 12:55:36,636 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 12:55:36,636 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 12:55:36,636 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 12:55:36,636 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 12:55:36,637 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 12:55:36,637 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 12:55:36,637 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 12:55:36,637 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 12:55:36,637 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 12:55:36,638 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 12:55:36,638 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 12:55:36,638 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 12:55:36,638 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 12:55:36,638 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 12:55:36,639 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 12:55:36,639 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 12:55:36,639 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 12:55:36,639 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 12:55:36,639 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-23 12:55:36,640 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-23 12:55:36,685 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 12:55:36,705 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 12:55:36,709 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 12:55:36,710 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 12:55:36,711 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 12:55:36,712 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i
[2018-11-23 12:55:36,780 INFO  L221              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83369bde5/438b2fdd6cc640fe8c4ab0bd0cac2130/FLAG1946d6afa
[2018-11-23 12:55:37,288 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 12:55:37,290 INFO  L161              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i
[2018-11-23 12:55:37,306 INFO  L355              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83369bde5/438b2fdd6cc640fe8c4ab0bd0cac2130/FLAG1946d6afa
[2018-11-23 12:55:37,570 INFO  L363              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83369bde5/438b2fdd6cc640fe8c4ab0bd0cac2130
[2018-11-23 12:55:37,579 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 12:55:37,580 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 12:55:37,581 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 12:55:37,582 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 12:55:37,585 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 12:55:37,587 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:37" (1/1) ...
[2018-11-23 12:55:37,590 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14dcd995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:37, skipping insertion in model container
[2018-11-23 12:55:37,590 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:37" (1/1) ...
[2018-11-23 12:55:37,601 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 12:55:37,670 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 12:55:38,152 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 12:55:38,173 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 12:55:38,256 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 12:55:38,324 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 12:55:38,324 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38 WrapperNode
[2018-11-23 12:55:38,324 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 12:55:38,325 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 12:55:38,326 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 12:55:38,326 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 12:55:38,336 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,356 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,457 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 12:55:38,458 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 12:55:38,458 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 12:55:38,458 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 12:55:38,469 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,470 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,480 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,481 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,517 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,529 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,534 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
[2018-11-23 12:55:38,541 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 12:55:38,542 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 12:55:38,542 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 12:55:38,542 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 12:55:38,543 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 12:55:38,618 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 12:55:38,619 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2018-11-23 12:55:38,619 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2018-11-23 12:55:38,619 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 12:55:38,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 12:55:38,621 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 12:55:38,621 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 12:55:38,621 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-11-23 12:55:38,622 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-11-23 12:55:38,622 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-11-23 12:55:38,622 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 12:55:38,622 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 12:55:39,839 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 12:55:39,840 INFO  L280             CfgBuilder]: Removed 8 assue(true) statements.
[2018-11-23 12:55:39,840 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:39 BoogieIcfgContainer
[2018-11-23 12:55:39,841 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 12:55:39,842 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 12:55:39,842 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 12:55:39,845 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 12:55:39,846 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:37" (1/3) ...
[2018-11-23 12:55:39,848 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3048a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:39, skipping insertion in model container
[2018-11-23 12:55:39,848 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:38" (2/3) ...
[2018-11-23 12:55:39,848 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a3048a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:39, skipping insertion in model container
[2018-11-23 12:55:39,849 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:39" (3/3) ...
[2018-11-23 12:55:39,850 INFO  L112   eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i
[2018-11-23 12:55:39,862 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 12:55:39,871 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 12:55:39,891 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 12:55:39,925 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 12:55:39,926 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 12:55:39,926 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 12:55:39,926 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 12:55:39,926 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 12:55:39,926 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 12:55:39,927 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 12:55:39,927 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 12:55:39,927 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 12:55:39,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states.
[2018-11-23 12:55:39,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-11-23 12:55:39,953 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 12:55:39,956 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 12:55:39,958 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 12:55:39,967 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 12:55:39,968 INFO  L82        PathProgramCache]: Analyzing trace with hash 208036314, now seen corresponding path program 1 times
[2018-11-23 12:55:39,970 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 12:55:39,971 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 12:55:40,029 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:40,029 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 12:55:40,030 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:40,070 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 12:55:40,150 INFO  L256        TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID
[2018-11-23 12:55:40,153 INFO  L273        TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID
[2018-11-23 12:55:40,154 INFO  L273        TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID
[2018-11-23 12:55:40,154 INFO  L268        TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #112#return; {34#true} is VALID
[2018-11-23 12:55:40,154 INFO  L256        TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret19 := main(); {34#true} is VALID
[2018-11-23 12:55:40,155 INFO  L273        TraceCheckUtils]: 5: Hoare triple {34#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {34#true} is VALID
[2018-11-23 12:55:40,164 INFO  L273        TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID
[2018-11-23 12:55:40,164 INFO  L273        TraceCheckUtils]: 7: Hoare triple {35#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35#false} is VALID
[2018-11-23 12:55:40,165 INFO  L273        TraceCheckUtils]: 8: Hoare triple {35#false} assume 0 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {35#false} is VALID
[2018-11-23 12:55:40,165 INFO  L273        TraceCheckUtils]: 9: Hoare triple {35#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {35#false} is VALID
[2018-11-23 12:55:40,165 INFO  L273        TraceCheckUtils]: 10: Hoare triple {35#false} assume !true; {35#false} is VALID
[2018-11-23 12:55:40,166 INFO  L273        TraceCheckUtils]: 11: Hoare triple {35#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {35#false} is VALID
[2018-11-23 12:55:40,166 INFO  L273        TraceCheckUtils]: 12: Hoare triple {35#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4); {35#false} is VALID
[2018-11-23 12:55:40,166 INFO  L273        TraceCheckUtils]: 13: Hoare triple {35#false} assume 1 != #t~mem16;havoc #t~mem16; {35#false} is VALID
[2018-11-23 12:55:40,167 INFO  L273        TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID
[2018-11-23 12:55:40,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-11-23 12:55:40,173 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 12:55:40,173 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-11-23 12:55:40,178 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 15
[2018-11-23 12:55:40,181 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 12:55:40,184 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states.
[2018-11-23 12:55:40,346 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 12:55:40,347 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-11-23 12:55:40,357 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-11-23 12:55:40,358 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-11-23 12:55:40,361 INFO  L87              Difference]: Start difference. First operand 31 states. Second operand 2 states.
[2018-11-23 12:55:40,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:40,659 INFO  L93              Difference]: Finished difference Result 53 states and 80 transitions.
[2018-11-23 12:55:40,659 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-11-23 12:55:40,659 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 15
[2018-11-23 12:55:40,659 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 12:55:40,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2018-11-23 12:55:40,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions.
[2018-11-23 12:55:40,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2018-11-23 12:55:40,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions.
[2018-11-23 12:55:40,679 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 80 transitions.
[2018-11-23 12:55:41,149 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 12:55:41,161 INFO  L225             Difference]: With dead ends: 53
[2018-11-23 12:55:41,161 INFO  L226             Difference]: Without dead ends: 23
[2018-11-23 12:55:41,165 INFO  L631         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-11-23 12:55:41,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2018-11-23 12:55:41,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2018-11-23 12:55:41,207 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 12:55:41,207 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states.
[2018-11-23 12:55:41,208 INFO  L74              IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states.
[2018-11-23 12:55:41,208 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 23 states.
[2018-11-23 12:55:41,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:41,212 INFO  L93              Difference]: Finished difference Result 23 states and 28 transitions.
[2018-11-23 12:55:41,212 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions.
[2018-11-23 12:55:41,213 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 12:55:41,213 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 12:55:41,214 INFO  L74              IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states.
[2018-11-23 12:55:41,214 INFO  L87              Difference]: Start difference. First operand 23 states. Second operand 23 states.
[2018-11-23 12:55:41,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:41,218 INFO  L93              Difference]: Finished difference Result 23 states and 28 transitions.
[2018-11-23 12:55:41,218 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions.
[2018-11-23 12:55:41,219 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 12:55:41,219 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 12:55:41,219 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 12:55:41,220 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 12:55:41,220 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2018-11-23 12:55:41,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions.
[2018-11-23 12:55:41,224 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15
[2018-11-23 12:55:41,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 12:55:41,225 INFO  L480      AbstractCegarLoop]: Abstraction has 23 states and 28 transitions.
[2018-11-23 12:55:41,225 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-11-23 12:55:41,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions.
[2018-11-23 12:55:41,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-11-23 12:55:41,226 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 12:55:41,226 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 12:55:41,227 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 12:55:41,227 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 12:55:41,227 INFO  L82        PathProgramCache]: Analyzing trace with hash 592716228, now seen corresponding path program 1 times
[2018-11-23 12:55:41,227 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 12:55:41,228 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 12:55:41,230 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:41,230 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 12:55:41,230 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:41,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 12:55:41,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 12:55:41,340 INFO  L469         BasicCegarLoop]: Counterexample might be feasible
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]  CALL  call ULTIMATE.init();
     VAL   [|#NULL.base|=15, |#NULL.offset|=9, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]  RET   #112#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]  CALL  call #t~ret19 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0]
[?]        assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0]
[?]        assume !(0 != #t~nondet1);havoc #t~nondet1;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0]
[?]        assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet4|=1]
[?]        assume 0 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0, |main_#t~mem13|=1]
[?]        assume !(1 != #t~mem13);havoc #t~mem13;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0, |main_#t~mem16|=0]
[?]        assume 1 != #t~mem16;havoc #t~mem16;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        assume !false;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]


[?]            CALL  call ULTIMATE.init();
               VAL   [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  #NULL.base, #NULL.offset := 0, 0;
[?]                  #valid := #valid[0 := 0];
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  ensures true;
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]            RET   call ULTIMATE.init();
               VAL   [#NULL.base=0, #NULL.offset=0]
[?]            CALL  call #t~ret19 := main();
               VAL   [#NULL.base=0, #NULL.offset=0]
[L988]               call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L988]               ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;
[L989]               call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);
[L990]               call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);
[L992]               ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995]               assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995-L1002]         assume !(0 != #t~nondet1);
[L995]               havoc #t~nondet1;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005]              assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet4=1, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005-L1026]        assume 0 != #t~nondet4;
[L1005]              havoc #t~nondet4;
[L1006]              call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);
[L1006]              ~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;
[L1007]              call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);
[L1008]              call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);
[L1009]              ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1029]              ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032]              call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem13=1, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032-L1035]        assume !(1 != #t~mem13);
[L1032]              havoc #t~mem13;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1038]              call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);
[L1038]              ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;
[L1038]              havoc #t~mem15.base, #t~mem15.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1039-L1044]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);
[L1041]              call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem16=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1041-L1042]        assume 1 != #t~mem16;
[L1041]              havoc #t~mem16;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1042]              assert false;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]            CALL  call ULTIMATE.init();
               VAL   [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  #NULL.base, #NULL.offset := 0, 0;
[?]                  #valid := #valid[0 := 0];
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  ensures true;
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]            RET   call ULTIMATE.init();
               VAL   [#NULL.base=0, #NULL.offset=0]
[?]            CALL  call #t~ret19 := main();
               VAL   [#NULL.base=0, #NULL.offset=0]
[L988]               call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L988]               ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;
[L989]               call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);
[L990]               call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);
[L992]               ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995]               assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995-L1002]         assume !(0 != #t~nondet1);
[L995]               havoc #t~nondet1;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005]              assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet4=1, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005-L1026]        assume 0 != #t~nondet4;
[L1005]              havoc #t~nondet4;
[L1006]              call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);
[L1006]              ~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;
[L1007]              call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);
[L1008]              call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);
[L1009]              ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1029]              ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032]              call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem13=1, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032-L1035]        assume !(1 != #t~mem13);
[L1032]              havoc #t~mem13;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1038]              call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);
[L1038]              ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;
[L1038]              havoc #t~mem15.base, #t~mem15.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1039-L1044]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);
[L1041]              call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem16=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1041-L1042]        assume 1 != #t~mem16;
[L1041]              havoc #t~mem16;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1042]              assert false;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]


[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]


[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]


[L988]               SLL* head = malloc(sizeof(SLL));
[L989]               head->next = ((void*)0)
[L990]               head->data = 0
[L992]               SLL* x = head;
         VAL         [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}]
[L995]   COND FALSE  !(__VERIFIER_nondet_int())
[L1005]  COND TRUE   __VERIFIER_nondet_int()
[L1006]              x = malloc(sizeof(SLL))
[L1007]              x->data = 1
[L1008]              x->next = head
[L1009]              head = x
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1029]              x = head
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1032]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->data=1]
[L1032]  COND FALSE  !(x->data != 1)
[L1038]  EXPR        x->next
[L1038]              x = x->next
[L1039]  COND TRUE   \read(*x)
[L1041]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}, x->data=0]
[L1041]  COND TRUE   x->data != 1
[L1042]              __VERIFIER_error()
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}]

-----
[2018-11-23 12:55:41,403 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2018-11-23 12:55:41,403 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 12:55:41,403 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 12:55:41,403 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: L995-3 has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: L995-3 has no Hoare annotation
[2018-11-23 12:55:41,404 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: L995-4 has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: L995-1 has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: L995-1 has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: L1005 has no Hoare annotation
[2018-11-23 12:55:41,405 WARN  L170   areAnnotationChecker]: L1005 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1005-2 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1015-3 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1015-3 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1032-3 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1032-3 has no Hoare annotation
[2018-11-23 12:55:41,406 WARN  L170   areAnnotationChecker]: L1015-4 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1015-1 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1015-1 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1032-4 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1032-1 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1032-1 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1017 has no Hoare annotation
[2018-11-23 12:55:41,407 WARN  L170   areAnnotationChecker]: L1017 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1039-2 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1039-2 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1039-2 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1039-3 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1041 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1041 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1048-2 has no Hoare annotation
[2018-11-23 12:55:41,408 WARN  L170   areAnnotationChecker]: L1048-2 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1048-2 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1042-3 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1042-3 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1042-3 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1042-3 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1041-1 has no Hoare annotation
[2018-11-23 12:55:41,409 WARN  L170   areAnnotationChecker]: L1048-3 has no Hoare annotation
[2018-11-23 12:55:41,410 WARN  L170   areAnnotationChecker]: L1042-2 has no Hoare annotation
[2018-11-23 12:55:41,410 WARN  L170   areAnnotationChecker]: L1042-2 has no Hoare annotation
[2018-11-23 12:55:41,410 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2018-11-23 12:55:41,410 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2018-11-23 12:55:41,410 INFO  L163   areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2018-11-23 12:55:41,413 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:41 BoogieIcfgContainer
[2018-11-23 12:55:41,414 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 12:55:41,414 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 12:55:41,415 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 12:55:41,415 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 12:55:41,416 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:39" (3/4) ...
[2018-11-23 12:55:41,419 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|=15, |#NULL.offset|=9, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9]
[?]  RET   #112#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]  CALL  call #t~ret19 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]        call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0]
[?]        assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0]
[?]        assume !(0 != #t~nondet1);havoc #t~nondet1;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0]
[?]        assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
     VAL   [main_~head~0.base=14, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~nondet4|=1]
[?]        assume 0 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0, |main_#t~mem13|=1]
[?]        assume !(1 != #t~mem13);havoc #t~mem13;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0, |main_#t~mem16|=0]
[?]        assume 1 != #t~mem16;havoc #t~mem16;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]
[?]        assume !false;
     VAL   [main_~head~0.base=17, main_~head~0.offset=0, main_~x~0.base=14, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=14, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=17, |main_#t~malloc5.offset|=0]


[?]            CALL  call ULTIMATE.init();
               VAL   [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  #NULL.base, #NULL.offset := 0, 0;
[?]                  #valid := #valid[0 := 0];
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  ensures true;
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]            RET   call ULTIMATE.init();
               VAL   [#NULL.base=0, #NULL.offset=0]
[?]            CALL  call #t~ret19 := main();
               VAL   [#NULL.base=0, #NULL.offset=0]
[L988]               call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L988]               ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;
[L989]               call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);
[L990]               call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);
[L992]               ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995]               assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995-L1002]         assume !(0 != #t~nondet1);
[L995]               havoc #t~nondet1;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005]              assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet4=1, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005-L1026]        assume 0 != #t~nondet4;
[L1005]              havoc #t~nondet4;
[L1006]              call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);
[L1006]              ~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;
[L1007]              call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);
[L1008]              call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);
[L1009]              ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1029]              ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032]              call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem13=1, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032-L1035]        assume !(1 != #t~mem13);
[L1032]              havoc #t~mem13;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1038]              call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);
[L1038]              ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;
[L1038]              havoc #t~mem15.base, #t~mem15.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1039-L1044]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);
[L1041]              call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem16=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1041-L1042]        assume 1 != #t~mem16;
[L1041]              havoc #t~mem16;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1042]              assert false;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]            CALL  call ULTIMATE.init();
               VAL   [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  #NULL.base, #NULL.offset := 0, 0;
[?]                  #valid := #valid[0 := 0];
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]                  ensures true;
               VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9]
[?]            RET   call ULTIMATE.init();
               VAL   [#NULL.base=0, #NULL.offset=0]
[?]            CALL  call #t~ret19 := main();
               VAL   [#NULL.base=0, #NULL.offset=0]
[L988]               call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L988]               ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;
[L989]               call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);
[L990]               call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);
[L992]               ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995]               assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L995-L1002]         assume !(0 != #t~nondet1);
[L995]               havoc #t~nondet1;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005]              assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~nondet4=1, ~head~0.base=14, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1005-L1026]        assume 0 != #t~nondet4;
[L1005]              havoc #t~nondet4;
[L1006]              call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8);
[L1006]              ~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;
[L1007]              call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);
[L1008]              call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);
[L1009]              ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1029]              ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032]              call #t~mem13 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem13=1, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1032-L1035]        assume !(1 != #t~mem13);
[L1032]              havoc #t~mem13;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=17, ~x~0.offset=0]
[L1038]              call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);
[L1038]              ~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;
[L1038]              havoc #t~mem15.base, #t~mem15.offset;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1039-L1044]        assume !!(~x~0.base != 0 || ~x~0.offset != 0);
[L1041]              call #t~mem16 := read~int(~x~0.base, 4 + ~x~0.offset, 4);
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, #t~mem16=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1041-L1042]        assume 1 != #t~mem16;
[L1041]              havoc #t~mem16;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]
[L1042]              assert false;
               VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=14, #t~malloc0.offset=0, #t~malloc5.base=17, #t~malloc5.offset=0, ~head~0.base=17, ~head~0.offset=0, ~x~0.base=14, ~x~0.offset=0]


[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]


[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]            CALL        call ULTIMATE.init();
               VAL         [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]                        #NULL := { base: 0, offset: 0 };
[?]                        #valid[0] := 0;
               VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9]
[?]            RET         call ULTIMATE.init();
               VAL         [#NULL!base=0, #NULL!offset=0]
[?]            CALL        call #t~ret19 := main();
               VAL         [#NULL!base=0, #NULL!offset=0]
[L988]         FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L988]                     ~head~0 := #t~malloc0;
[L989]         FCALL       call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4);
[L990]         FCALL       call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4);
[L992]                     ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995]                     assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L995-L1002]   COND TRUE   !(0 != #t~nondet1)
[L995]                     havoc #t~nondet1;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005]                    assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~nondet4=1, ~head~0!base=14, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1005-L1026]  COND TRUE   0 != #t~nondet4
[L1005]                    havoc #t~nondet4;
[L1006]        FCALL       call #t~malloc5 := #Ultimate.alloc(8);
[L1006]                    ~x~0 := #t~malloc5;
[L1007]        FCALL       call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
[L1008]        FCALL       call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1009]                    ~head~0 := ~x~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1029]                    ~x~0 := ~head~0;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032]        FCALL       call #t~mem13 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem13=1, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1032-L1035]  COND TRUE   !(1 != #t~mem13)
[L1032]                    havoc #t~mem13;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=17, ~x~0!offset=0]
[L1038]        FCALL       call #t~mem15 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4);
[L1038]                    ~x~0 := #t~mem15;
[L1038]                    havoc #t~mem15;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1039-L1044]  COND FALSE  !(!(~x~0 != { base: 0, offset: 0 }))
[L1041]        FCALL       call #t~mem16 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4);
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, #t~mem16=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1041]        COND TRUE   1 != #t~mem16
[L1041]                    havoc #t~mem16;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]
[L1042]                    assert false;
               VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=14, #t~malloc0!offset=0, #t~malloc5!base=17, #t~malloc5!offset=0, ~head~0!base=17, ~head~0!offset=0, ~x~0!base=14, ~x~0!offset=0]


[L988]               SLL* head = malloc(sizeof(SLL));
[L989]               head->next = ((void*)0)
[L990]               head->data = 0
[L992]               SLL* x = head;
         VAL         [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}]
[L995]   COND FALSE  !(__VERIFIER_nondet_int())
[L1005]  COND TRUE   __VERIFIER_nondet_int()
[L1006]              x = malloc(sizeof(SLL))
[L1007]              x->data = 1
[L1008]              x->next = head
[L1009]              head = x
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1029]              x = head
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1032]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->data=1]
[L1032]  COND FALSE  !(x->data != 1)
[L1038]  EXPR        x->next
[L1038]              x = x->next
[L1039]  COND TRUE   \read(*x)
[L1041]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}, x->data=0]
[L1041]  COND TRUE   x->data != 1
[L1042]              __VERIFIER_error()
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}]

-----
[2018-11-23 12:55:41,500 INFO  L145         WitnessManager]: Wrote witness to /storage/repos/svcomp/c/forester-heap/sll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i-witness.graphml
[2018-11-23 12:55:41,501 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 12:55:41,503 INFO  L168              Benchmark]: Toolchain (without parser) took 3922.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -676.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,505 INFO  L168              Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,505 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 743.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,506 INFO  L168              Benchmark]: Boogie Procedure Inliner took 132.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,507 INFO  L168              Benchmark]: Boogie Preprocessor took 83.42 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,508 INFO  L168              Benchmark]: RCFGBuilder took 1298.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,509 INFO  L168              Benchmark]: TraceAbstraction took 1572.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,509 INFO  L168              Benchmark]: Witness Printer took 86.43 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-11-23 12:55:41,515 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - GenericResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 743.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 132.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 83.42 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 1298.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 1572.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 7.1 GB.
 * Witness Printer took 86.43 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 1042]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L988]               SLL* head = malloc(sizeof(SLL));
[L989]               head->next = ((void*)0)
[L990]               head->data = 0
[L992]               SLL* x = head;
         VAL         [head={14:0}, malloc(sizeof(SLL))={14:0}, x={14:0}]
[L995]   COND FALSE  !(__VERIFIER_nondet_int())
[L1005]  COND TRUE   __VERIFIER_nondet_int()
[L1006]              x = malloc(sizeof(SLL))
[L1007]              x->data = 1
[L1008]              x->next = head
[L1009]              head = x
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1029]              x = head
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}]
[L1032]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->data=1]
[L1032]  COND FALSE  !(x->data != 1)
[L1038]  EXPR        x->next
[L1038]              x = x->next
[L1039]  COND TRUE   \read(*x)
[L1041]  EXPR        x->data
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}, x->data=0]
[L1041]  COND TRUE   x->data != 1
[L1042]              __VERIFIER_error()
         VAL         [head={17:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={17:0}, x={14:0}]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 31 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...