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/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i


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


This is Ultimate 0.1.23-61f4311
[2018-11-23 12:55:49,250 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-11-23 12:55:49,252 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-11-23 12:55:49,265 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-11-23 12:55:49,265 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-11-23 12:55:49,266 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-11-23 12:55:49,269 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-11-23 12:55:49,273 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-11-23 12:55:49,276 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-11-23 12:55:49,280 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-11-23 12:55:49,284 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-11-23 12:55:49,284 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-11-23 12:55:49,287 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-11-23 12:55:49,288 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-11-23 12:55:49,289 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-11-23 12:55:49,292 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-11-23 12:55:49,293 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-11-23 12:55:49,300 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-11-23 12:55:49,306 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-11-23 12:55:49,308 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-11-23 12:55:49,311 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-11-23 12:55:49,312 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-11-23 12:55:49,319 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-11-23 12:55:49,319 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-11-23 12:55:49,319 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-11-23 12:55:49,323 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-11-23 12:55:49,324 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-11-23 12:55:49,324 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-11-23 12:55:49,325 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-11-23 12:55:49,326 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-11-23 12:55:49,326 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-11-23 12:55:49,332 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-11-23 12:55:49,332 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-11-23 12:55:49,333 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-11-23 12:55:49,336 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-11-23 12:55:49,337 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-11-23 12:55:49,337 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:49,368 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-11-23 12:55:49,368 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-11-23 12:55:49,369 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-11-23 12:55:49,369 INFO  L133        SettingsManager]:  * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS
[2018-11-23 12:55:49,371 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-11-23 12:55:49,371 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-11-23 12:55:49,371 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-11-23 12:55:49,371 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-11-23 12:55:49,372 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-11-23 12:55:49,373 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-11-23 12:55:49,373 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-11-23 12:55:49,373 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-11-23 12:55:49,373 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-11-23 12:55:49,374 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-11-23 12:55:49,374 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-11-23 12:55:49,374 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-11-23 12:55:49,374 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-11-23 12:55:49,374 INFO  L133        SettingsManager]:  * Use constant arrays=true
[2018-11-23 12:55:49,375 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-11-23 12:55:49,375 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-11-23 12:55:49,375 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-11-23 12:55:49,375 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-11-23 12:55:49,375 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-11-23 12:55:49,376 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-11-23 12:55:49,376 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-11-23 12:55:49,376 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-11-23 12:55:49,376 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-11-23 12:55:49,376 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-11-23 12:55:49,378 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-11-23 12:55:49,378 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-11-23 12:55:49,378 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-11-23 12:55:49,454 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-11-23 12:55:49,473 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-11-23 12:55:49,477 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-11-23 12:55:49,478 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-11-23 12:55:49,479 INFO  L276        PluginConnector]: CDTParser initialized
[2018-11-23 12:55:49,479 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i
[2018-11-23 12:55:49,536 INFO  L221              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a561ac1/86aeed2c7b274cb0b9bdf14b28512224/FLAGccd445c3f
[2018-11-23 12:55:50,079 INFO  L307              CDTParser]: Found 1 translation units.
[2018-11-23 12:55:50,080 INFO  L161              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i
[2018-11-23 12:55:50,093 INFO  L355              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a561ac1/86aeed2c7b274cb0b9bdf14b28512224/FLAGccd445c3f
[2018-11-23 12:55:50,377 INFO  L363              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63a561ac1/86aeed2c7b274cb0b9bdf14b28512224
[2018-11-23 12:55:50,389 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-11-23 12:55:50,391 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2018-11-23 12:55:50,392 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-11-23 12:55:50,392 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-11-23 12:55:50,396 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-11-23 12:55:50,398 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ...
[2018-11-23 12:55:50,401 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e445f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50, skipping insertion in model container
[2018-11-23 12:55:50,401 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:50" (1/1) ...
[2018-11-23 12:55:50,412 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-11-23 12:55:50,473 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2018-11-23 12:55:50,819 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 12:55:50,832 INFO  L191         MainTranslator]: Completed pre-run
[2018-11-23 12:55:50,891 INFO  L201          PostProcessor]: Analyzing one entry point: main
[2018-11-23 12:55:50,954 INFO  L195         MainTranslator]: Completed translation
[2018-11-23 12:55:50,955 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50 WrapperNode
[2018-11-23 12:55:50,955 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-11-23 12:55:50,956 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-11-23 12:55:50,956 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-11-23 12:55:50,956 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-11-23 12:55:51,040 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:50" (1/1) ...
[2018-11-23 12:55:51,063 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:50" (1/1) ...
[2018-11-23 12:55:51,074 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-11-23 12:55:51,075 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-11-23 12:55:51,075 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-11-23 12:55:51,075 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-11-23 12:55:51,084 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:50" (1/1) ...
[2018-11-23 12:55:51,085 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:50" (1/1) ...
[2018-11-23 12:55:51,089 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:50" (1/1) ...
[2018-11-23 12:55:51,089 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:50" (1/1) ...
[2018-11-23 12:55:51,121 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:50" (1/1) ...
[2018-11-23 12:55:51,131 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:50" (1/1) ...
[2018-11-23 12:55:51,133 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:50" (1/1) ...
[2018-11-23 12:55:51,137 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-11-23 12:55:51,137 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-11-23 12:55:51,137 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-11-23 12:55:51,138 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-11-23 12:55:51,139 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (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:51,195 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-11-23 12:55:51,195 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2018-11-23 12:55:51,196 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2018-11-23 12:55:51,196 INFO  L138     BoogieDeclarations]: Found implementation of procedure exit
[2018-11-23 12:55:51,196 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2018-11-23 12:55:51,196 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-11-23 12:55:51,196 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-11-23 12:55:51,196 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2018-11-23 12:55:51,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2018-11-23 12:55:51,197 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-11-23 12:55:51,197 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-11-23 12:55:51,197 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-11-23 12:55:51,197 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-11-23 12:55:51,197 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-11-23 12:55:52,207 INFO  L275             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-11-23 12:55:52,208 INFO  L280             CfgBuilder]: Removed 5 assue(true) statements.
[2018-11-23 12:55:52,208 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52 BoogieIcfgContainer
[2018-11-23 12:55:52,208 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-11-23 12:55:52,209 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-11-23 12:55:52,209 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-11-23 12:55:52,212 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-11-23 12:55:52,213 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:50" (1/3) ...
[2018-11-23 12:55:52,214 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ca33e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container
[2018-11-23 12:55:52,214 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:50" (2/3) ...
[2018-11-23 12:55:52,214 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ca33e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:52, skipping insertion in model container
[2018-11-23 12:55:52,214 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:52" (3/3) ...
[2018-11-23 12:55:52,216 INFO  L112   eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i
[2018-11-23 12:55:52,226 INFO  L156   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-11-23 12:55:52,234 INFO  L168   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-11-23 12:55:52,253 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-11-23 12:55:52,289 INFO  L133   ementStrategyFactory]: Using default assertion order modulation
[2018-11-23 12:55:52,290 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-11-23 12:55:52,290 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-11-23 12:55:52,291 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-11-23 12:55:52,291 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-11-23 12:55:52,291 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-11-23 12:55:52,291 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-11-23 12:55:52,292 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-11-23 12:55:52,292 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-11-23 12:55:52,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 40 states.
[2018-11-23 12:55:52,318 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-11-23 12:55:52,318 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 12:55:52,319 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 12:55:52,322 INFO  L423      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 12:55:52,328 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 12:55:52,328 INFO  L82        PathProgramCache]: Analyzing trace with hash 853425561, now seen corresponding path program 1 times
[2018-11-23 12:55:52,330 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 12:55:52,331 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 12:55:52,384 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:52,384 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 12:55:52,385 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:52,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-11-23 12:55:52,485 INFO  L256        TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID
[2018-11-23 12:55:52,489 INFO  L273        TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43#true} is VALID
[2018-11-23 12:55:52,490 INFO  L273        TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID
[2018-11-23 12:55:52,490 INFO  L268        TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #125#return; {43#true} is VALID
[2018-11-23 12:55:52,490 INFO  L256        TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret20 := main(); {43#true} is VALID
[2018-11-23 12:55:52,491 INFO  L273        TraceCheckUtils]: 5: Hoare triple {43#true} ~i~0 := 0;~y~0 := 0;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {43#true} is VALID
[2018-11-23 12:55:52,491 INFO  L273        TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {43#true} is VALID
[2018-11-23 12:55:52,491 INFO  L273        TraceCheckUtils]: 7: Hoare triple {43#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {43#true} is VALID
[2018-11-23 12:55:52,493 INFO  L273        TraceCheckUtils]: 8: Hoare triple {43#true} assume !true; {44#false} is VALID
[2018-11-23 12:55:52,493 INFO  L273        TraceCheckUtils]: 9: Hoare triple {44#false} assume !true; {44#false} is VALID
[2018-11-23 12:55:52,493 INFO  L273        TraceCheckUtils]: 10: Hoare triple {44#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~i~0 := 0;~y~0 := 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {44#false} is VALID
[2018-11-23 12:55:52,494 INFO  L273        TraceCheckUtils]: 11: Hoare triple {44#false} assume !true; {44#false} is VALID
[2018-11-23 12:55:52,494 INFO  L273        TraceCheckUtils]: 12: Hoare triple {44#false} assume !true; {44#false} is VALID
[2018-11-23 12:55:52,494 INFO  L273        TraceCheckUtils]: 13: Hoare triple {44#false} call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4); {44#false} is VALID
[2018-11-23 12:55:52,495 INFO  L273        TraceCheckUtils]: 14: Hoare triple {44#false} assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;havoc #t~mem17; {44#false} is VALID
[2018-11-23 12:55:52,495 INFO  L273        TraceCheckUtils]: 15: Hoare triple {44#false} assume !false; {44#false} is VALID
[2018-11-23 12:55:52,499 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:52,502 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-11-23 12:55:52,502 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-11-23 12:55:52,508 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 16
[2018-11-23 12:55:52,511 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2018-11-23 12:55:52,515 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states.
[2018-11-23 12:55:52,609 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 12:55:52,609 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-11-23 12:55:52,621 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-11-23 12:55:52,622 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-11-23 12:55:52,625 INFO  L87              Difference]: Start difference. First operand 40 states. Second operand 2 states.
[2018-11-23 12:55:52,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:52,803 INFO  L93              Difference]: Finished difference Result 65 states and 90 transitions.
[2018-11-23 12:55:52,804 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-11-23 12:55:52,804 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 16
[2018-11-23 12:55:52,804 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-11-23 12:55:52,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2018-11-23 12:55:52,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions.
[2018-11-23 12:55:52,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2018-11-23 12:55:52,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions.
[2018-11-23 12:55:52,825 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions.
[2018-11-23 12:55:53,175 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2018-11-23 12:55:53,188 INFO  L225             Difference]: With dead ends: 65
[2018-11-23 12:55:53,188 INFO  L226             Difference]: Without dead ends: 27
[2018-11-23 12:55:53,192 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:53,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2018-11-23 12:55:53,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2018-11-23 12:55:53,289 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2018-11-23 12:55:53,290 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states.
[2018-11-23 12:55:53,291 INFO  L74              IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states.
[2018-11-23 12:55:53,291 INFO  L87              Difference]: Start difference. First operand 27 states. Second operand 27 states.
[2018-11-23 12:55:53,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:53,296 INFO  L93              Difference]: Finished difference Result 27 states and 32 transitions.
[2018-11-23 12:55:53,296 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions.
[2018-11-23 12:55:53,297 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 12:55:53,297 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 12:55:53,298 INFO  L74              IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states.
[2018-11-23 12:55:53,298 INFO  L87              Difference]: Start difference. First operand 27 states. Second operand 27 states.
[2018-11-23 12:55:53,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-11-23 12:55:53,302 INFO  L93              Difference]: Finished difference Result 27 states and 32 transitions.
[2018-11-23 12:55:53,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions.
[2018-11-23 12:55:53,303 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-11-23 12:55:53,303 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2018-11-23 12:55:53,304 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2018-11-23 12:55:53,304 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2018-11-23 12:55:53,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2018-11-23 12:55:53,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions.
[2018-11-23 12:55:53,309 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16
[2018-11-23 12:55:53,309 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-11-23 12:55:53,310 INFO  L480      AbstractCegarLoop]: Abstraction has 27 states and 32 transitions.
[2018-11-23 12:55:53,310 INFO  L481      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-11-23 12:55:53,310 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions.
[2018-11-23 12:55:53,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-11-23 12:55:53,312 INFO  L394         BasicCegarLoop]: Found error trace
[2018-11-23 12:55:53,312 INFO  L402         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-11-23 12:55:53,312 INFO  L423      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-11-23 12:55:53,313 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-11-23 12:55:53,313 INFO  L82        PathProgramCache]: Analyzing trace with hash -1145487297, now seen corresponding path program 1 times
[2018-11-23 12:55:53,313 INFO  L223   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-11-23 12:55:53,313 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-11-23 12:55:53,314 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:53,315 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-11-23 12:55:53,315 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-11-23 12:55:53,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 12:55:53,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-11-23 12:55:53,444 INFO  L469         BasicCegarLoop]: Counterexample might be feasible
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator
[?]  CALL  call ULTIMATE.init();
     VAL   [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]  RET   #125#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]  CALL  call #t~ret20 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]        ~i~0 := 0;~y~0 := 0;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        assume !(~a~0.base == 0 && ~a~0.offset == 0);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        #t~short2 := ~i~0 < 10;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short2|=true]
[?]        assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false]
[?]        assume !#t~short2;havoc #t~nondet1;havoc #t~short2;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        #t~short7 := ~y~0 < 10;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short7|=true]
[?]        assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet6|=0, |main_#t~short7|=false]
[?]        assume !#t~short7;havoc #t~nondet6;havoc #t~short7;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call write~int(3, ~p~0.base, ~p~0.offset, 4);~i~0 := 0;~y~0 := 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem11|=3]
[?]        assume !(1 == #t~mem11);havoc #t~mem11;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem14|=3]
[?]        assume !(2 == #t~mem14);havoc #t~mem14;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem17|=3]
[?]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;havoc #t~mem17;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        assume !false;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]


[?]          CALL  call ULTIMATE.init();
             VAL   [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                #NULL.base, #NULL.offset := 0, 0;
[?]                #valid := #valid[0 := 0];
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                ensures true;
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]          RET   call ULTIMATE.init();
             VAL   [#NULL.base=0, #NULL.offset=0]
[?]          CALL  call #t~ret20 := main();
             VAL   [#NULL.base=0, #NULL.offset=0]
[L627]             ~i~0 := 0;
[L628]             ~y~0 := 0;
[L629]             call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L629]             ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L630]             assume !(~a~0.base == 0 && ~a~0.offset == 0);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L631]             havoc ~t~0.base, ~t~0.offset;
[L632]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             #t~short2 := ~i~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             assume #t~short2;
[L633]             assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]             #t~short2 := 0 != #t~nondet1;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633-L640]        assume !#t~short2;
[L633]             havoc #t~nondet1;
[L633]             havoc #t~short2;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             #t~short7 := ~y~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             assume #t~short7;
[L641]             assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]             #t~short7 := 0 != #t~nondet6;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641-L648]        assume !#t~short7;
[L641]             havoc #t~nondet6;
[L641]             havoc #t~short7;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L649]             call write~int(3, ~p~0.base, ~p~0.offset, 4);
[L650]             ~i~0 := 0;
[L651]             ~y~0 := 0;
[L652]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653]             call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653-L656]        assume !(1 == #t~mem11);
[L653]             havoc #t~mem11;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657]             call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657-L660]        assume !(2 == #t~mem14);
[L657]             havoc #t~mem14;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661]             call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661-L662]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;
[L661]             havoc #t~mem17;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L662]             assert false;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]          CALL  call ULTIMATE.init();
             VAL   [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                #NULL.base, #NULL.offset := 0, 0;
[?]                #valid := #valid[0 := 0];
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                ensures true;
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]          RET   call ULTIMATE.init();
             VAL   [#NULL.base=0, #NULL.offset=0]
[?]          CALL  call #t~ret20 := main();
             VAL   [#NULL.base=0, #NULL.offset=0]
[L627]             ~i~0 := 0;
[L628]             ~y~0 := 0;
[L629]             call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L629]             ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L630]             assume !(~a~0.base == 0 && ~a~0.offset == 0);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L631]             havoc ~t~0.base, ~t~0.offset;
[L632]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             #t~short2 := ~i~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             assume #t~short2;
[L633]             assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]             #t~short2 := 0 != #t~nondet1;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633-L640]        assume !#t~short2;
[L633]             havoc #t~nondet1;
[L633]             havoc #t~short2;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             #t~short7 := ~y~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             assume #t~short7;
[L641]             assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]             #t~short7 := 0 != #t~nondet6;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641-L648]        assume !#t~short7;
[L641]             havoc #t~nondet6;
[L641]             havoc #t~short7;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L649]             call write~int(3, ~p~0.base, ~p~0.offset, 4);
[L650]             ~i~0 := 0;
[L651]             ~y~0 := 0;
[L652]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653]             call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653-L656]        assume !(1 == #t~mem11);
[L653]             havoc #t~mem11;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657]             call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657-L660]        assume !(2 == #t~mem14);
[L657]             havoc #t~mem14;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661]             call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661-L662]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;
[L661]             havoc #t~mem17;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L662]             assert false;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]


[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]


[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]


[L627]              int i = 0;
[L628]              int y = 0;
[L629]              List a = (List) malloc(sizeof(struct node));
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L630]  COND FALSE  !(a == 0)
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L631]              List t;
[L632]              List p = a;
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]              i < 10 && __VERIFIER_nondet_int()
[L633]              i < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]  COND FALSE  !(i < 10 && __VERIFIER_nondet_int())
[L641]              y < 10 && __VERIFIER_nondet_int()
[L641]              y < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0]
[L641]  COND FALSE  !(y < 10 && __VERIFIER_nondet_int())
[L649]              p->h = 3
[L650]              i = 0
[L651]              y = 0
[L652]              p = a
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L653]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L653]  COND FALSE  !(p->h == 1)
[L657]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L657]  COND FALSE  !(p->h == 2)
[L661]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L661]  COND TRUE   p->h != 3 || (i + y) < 20
[L662]              __VERIFIER_error()
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]

-----
[2018-11-23 12:55:53,525 WARN  L170   areAnnotationChecker]: exitENTRY has no Hoare annotation
[2018-11-23 12:55:53,525 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2018-11-23 12:55:53,525 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 12:55:53,525 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2018-11-23 12:55:53,525 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2018-11-23 12:55:53,529 WARN  L170   areAnnotationChecker]: L620 has no Hoare annotation
[2018-11-23 12:55:53,529 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2018-11-23 12:55:53,529 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 12:55:53,529 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2018-11-23 12:55:53,529 WARN  L170   areAnnotationChecker]: L630 has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: L630 has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: L630-1 has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: L630-1 has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: L630-3 has no Hoare annotation
[2018-11-23 12:55:53,530 WARN  L170   areAnnotationChecker]: L633-5 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L633-5 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L641-4 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L641-4 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L633-1 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L633-1 has no Hoare annotation
[2018-11-23 12:55:53,531 WARN  L170   areAnnotationChecker]: L641-5 has no Hoare annotation
[2018-11-23 12:55:53,532 WARN  L170   areAnnotationChecker]: L641 has no Hoare annotation
[2018-11-23 12:55:53,533 WARN  L170   areAnnotationChecker]: L641 has no Hoare annotation
[2018-11-23 12:55:53,533 WARN  L170   areAnnotationChecker]: L633-3 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L633-3 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L653-3 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L653-3 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L641-2 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L641-2 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L637 has no Hoare annotation
[2018-11-23 12:55:53,534 WARN  L170   areAnnotationChecker]: L637 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L657-2 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L657-2 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L653-1 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L653-1 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L645 has no Hoare annotation
[2018-11-23 12:55:53,535 WARN  L170   areAnnotationChecker]: L645 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L637-1 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L637-1 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L637-3 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L657-3 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L657 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L657 has no Hoare annotation
[2018-11-23 12:55:53,536 WARN  L170   areAnnotationChecker]: L645-1 has no Hoare annotation
[2018-11-23 12:55:53,538 WARN  L170   areAnnotationChecker]: L645-1 has no Hoare annotation
[2018-11-23 12:55:53,538 WARN  L170   areAnnotationChecker]: L645-3 has no Hoare annotation
[2018-11-23 12:55:53,538 WARN  L170   areAnnotationChecker]: L661 has no Hoare annotation
[2018-11-23 12:55:53,538 WARN  L170   areAnnotationChecker]: L661 has no Hoare annotation
[2018-11-23 12:55:53,538 WARN  L170   areAnnotationChecker]: L662 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L662 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L661-2 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L664-3 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L664-3 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L664-4 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L664-1 has no Hoare annotation
[2018-11-23 12:55:53,539 WARN  L170   areAnnotationChecker]: L664-1 has no Hoare annotation
[2018-11-23 12:55:53,540 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2018-11-23 12:55:53,540 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2018-11-23 12:55:53,540 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:53,543 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:53 BoogieIcfgContainer
[2018-11-23 12:55:53,543 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-11-23 12:55:53,546 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2018-11-23 12:55:53,546 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2018-11-23 12:55:53,546 INFO  L276        PluginConnector]: Witness Printer initialized
[2018-11-23 12:55:53,547 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:52" (3/4) ...
[2018-11-23 12:55:53,549 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|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]        #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]        assume true;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9]
[?]  RET   #125#return;
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]  CALL  call #t~ret20 := main();
     VAL   [|#NULL.base|=0, |#NULL.offset|=0]
[?]        ~i~0 := 0;~y~0 := 0;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        assume !(~a~0.base == 0 && ~a~0.offset == 0);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        #t~short2 := ~i~0 < 10;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short2|=true]
[?]        assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0, |main_#t~short2|=false]
[?]        assume !#t~short2;havoc #t~nondet1;havoc #t~short2;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        #t~short7 := ~y~0 < 10;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~short7|=true]
[?]        assume #t~short7;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;#t~short7 := 0 != #t~nondet6;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~nondet6|=0, |main_#t~short7|=false]
[?]        assume !#t~short7;havoc #t~nondet6;havoc #t~short7;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call write~int(3, ~p~0.base, ~p~0.offset, 4);~i~0 := 0;~y~0 := 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem11|=3]
[?]        assume !(1 == #t~mem11);havoc #t~mem11;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem14|=3]
[?]        assume !(2 == #t~mem14);havoc #t~mem14;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0, |main_#t~mem17|=3]
[?]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;havoc #t~mem17;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]
[?]        assume !false;
     VAL   [main_~a~0.base=10, main_~a~0.offset=0, main_~i~0=0, main_~p~0.base=10, main_~p~0.offset=0, main_~y~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=10, |main_#t~malloc0.offset|=0]


[?]          CALL  call ULTIMATE.init();
             VAL   [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                #NULL.base, #NULL.offset := 0, 0;
[?]                #valid := #valid[0 := 0];
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                ensures true;
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]          RET   call ULTIMATE.init();
             VAL   [#NULL.base=0, #NULL.offset=0]
[?]          CALL  call #t~ret20 := main();
             VAL   [#NULL.base=0, #NULL.offset=0]
[L627]             ~i~0 := 0;
[L628]             ~y~0 := 0;
[L629]             call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L629]             ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L630]             assume !(~a~0.base == 0 && ~a~0.offset == 0);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L631]             havoc ~t~0.base, ~t~0.offset;
[L632]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             #t~short2 := ~i~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             assume #t~short2;
[L633]             assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]             #t~short2 := 0 != #t~nondet1;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633-L640]        assume !#t~short2;
[L633]             havoc #t~nondet1;
[L633]             havoc #t~short2;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             #t~short7 := ~y~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             assume #t~short7;
[L641]             assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]             #t~short7 := 0 != #t~nondet6;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641-L648]        assume !#t~short7;
[L641]             havoc #t~nondet6;
[L641]             havoc #t~short7;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L649]             call write~int(3, ~p~0.base, ~p~0.offset, 4);
[L650]             ~i~0 := 0;
[L651]             ~y~0 := 0;
[L652]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653]             call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653-L656]        assume !(1 == #t~mem11);
[L653]             havoc #t~mem11;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657]             call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657-L660]        assume !(2 == #t~mem14);
[L657]             havoc #t~mem14;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661]             call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661-L662]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;
[L661]             havoc #t~mem17;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L662]             assert false;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator
[?]          CALL  call ULTIMATE.init();
             VAL   [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                #NULL.base, #NULL.offset := 0, 0;
[?]                #valid := #valid[0 := 0];
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]                ensures true;
             VAL   [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9]
[?]          RET   call ULTIMATE.init();
             VAL   [#NULL.base=0, #NULL.offset=0]
[?]          CALL  call #t~ret20 := main();
             VAL   [#NULL.base=0, #NULL.offset=0]
[L627]             ~i~0 := 0;
[L628]             ~y~0 := 0;
[L629]             call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);
[L629]             ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L630]             assume !(~a~0.base == 0 && ~a~0.offset == 0);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~y~0=0]
[L631]             havoc ~t~0.base, ~t~0.offset;
[L632]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             #t~short2 := ~i~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short2=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633]             assume #t~short2;
[L633]             assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]             #t~short2 := 0 != #t~nondet1;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet1=0, #t~short2=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L633-L640]        assume !#t~short2;
[L633]             havoc #t~nondet1;
[L633]             havoc #t~short2;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             #t~short7 := ~y~0 < 10;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~short7=true, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641]             assume #t~short7;
[L641]             assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]             #t~short7 := 0 != #t~nondet6;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~nondet6=0, #t~short7=false, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L641-L648]        assume !#t~short7;
[L641]             havoc #t~nondet6;
[L641]             havoc #t~short7;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L649]             call write~int(3, ~p~0.base, ~p~0.offset, 4);
[L650]             ~i~0 := 0;
[L651]             ~y~0 := 0;
[L652]             ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653]             call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem11=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L653-L656]        assume !(1 == #t~mem11);
[L653]             havoc #t~mem11;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657]             call #t~mem14 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem14=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L657-L660]        assume !(2 == #t~mem14);
[L657]             havoc #t~mem14;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661]             call #t~mem17 := read~int(~p~0.base, ~p~0.offset, 4);
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, #t~mem17=3, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L661-L662]        assume 3 != #t~mem17 || ~i~0 + ~y~0 < 20;
[L661]             havoc #t~mem17;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]
[L662]             assert false;
             VAL   [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=10, #t~malloc0.offset=0, ~a~0.base=10, ~a~0.offset=0, ~i~0=0, ~p~0.base=10, ~p~0.offset=0, ~y~0=0]


[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator
[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]


[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]

-----
-----
class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator
[?]          CALL        call ULTIMATE.init();
             VAL         [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]                      #NULL := { base: 0, offset: 0 };
[?]                      #valid[0] := 0;
             VAL         [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9]
[?]          RET         call ULTIMATE.init();
             VAL         [#NULL!base=0, #NULL!offset=0]
[?]          CALL        call #t~ret20 := main();
             VAL         [#NULL!base=0, #NULL!offset=0]
[L627]                   ~i~0 := 0;
[L628]                   ~y~0 := 0;
[L629]       FCALL       call #t~malloc0 := #Ultimate.alloc(8);
[L629]                   ~a~0 := #t~malloc0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L630]       COND FALSE  !(~a~0 == { base: 0, offset: 0 })
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~y~0=0]
[L631]                   havoc ~t~0;
[L632]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]                   #t~short2 := ~i~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short2=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633]       COND TRUE   #t~short2
[L633]                   assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;
[L633]                   #t~short2 := 0 != #t~nondet1;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet1=0, #t~short2=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L633-L640]  COND TRUE   !#t~short2
[L633]                   havoc #t~nondet1;
[L633]                   havoc #t~short2;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]                   #t~short7 := ~y~0 < 10;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~short7=true, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641]       COND TRUE   #t~short7
[L641]                   assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;
[L641]                   #t~short7 := 0 != #t~nondet6;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~nondet6=0, #t~short7=false, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L641-L648]  COND TRUE   !#t~short7
[L641]                   havoc #t~nondet6;
[L641]                   havoc #t~short7;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L649]       FCALL       call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4);
[L650]                   ~i~0 := 0;
[L651]                   ~y~0 := 0;
[L652]                   ~p~0 := ~a~0;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653]       FCALL       call #t~mem11 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem11=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L653-L656]  COND TRUE   !(1 == #t~mem11)
[L653]                   havoc #t~mem11;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657]       FCALL       call #t~mem14 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem14=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L657-L660]  COND TRUE   !(2 == #t~mem14)
[L657]                   havoc #t~mem14;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       FCALL       call #t~mem17 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4);
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, #t~mem17=3, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L661]       COND TRUE   3 != #t~mem17 || ~i~0 + ~y~0 < 20
[L661]                   havoc #t~mem17;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]
[L662]                   assert false;
             VAL         [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=10, #t~malloc0!offset=0, ~a~0!base=10, ~a~0!offset=0, ~i~0=0, ~p~0!base=10, ~p~0!offset=0, ~y~0=0]


[L627]              int i = 0;
[L628]              int y = 0;
[L629]              List a = (List) malloc(sizeof(struct node));
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L630]  COND FALSE  !(a == 0)
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L631]              List t;
[L632]              List p = a;
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]              i < 10 && __VERIFIER_nondet_int()
[L633]              i < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]  COND FALSE  !(i < 10 && __VERIFIER_nondet_int())
[L641]              y < 10 && __VERIFIER_nondet_int()
[L641]              y < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0]
[L641]  COND FALSE  !(y < 10 && __VERIFIER_nondet_int())
[L649]              p->h = 3
[L650]              i = 0
[L651]              y = 0
[L652]              p = a
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L653]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L653]  COND FALSE  !(p->h == 1)
[L657]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L657]  COND FALSE  !(p->h == 2)
[L661]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L661]  COND TRUE   p->h != 3 || (i + y) < 20
[L662]              __VERIFIER_error()
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]

-----
[2018-11-23 12:55:53,653 INFO  L145         WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i-witness.graphml
[2018-11-23 12:55:53,653 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2018-11-23 12:55:53,655 INFO  L168              Benchmark]: Toolchain (without parser) took 3264.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -657.9 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,657 INFO  L168              Benchmark]: CDTParser took 0.20 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:53,657 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 563.24 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,658 INFO  L168              Benchmark]: Boogie Procedure Inliner took 118.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,659 INFO  L168              Benchmark]: Boogie Preprocessor took 61.79 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:53,660 INFO  L168              Benchmark]: RCFGBuilder took 1071.04 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,660 INFO  L168              Benchmark]: TraceAbstraction took 1334.38 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: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,661 INFO  L168              Benchmark]: Witness Printer took 107.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB.
[2018-11-23 12:55:53,666 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.20 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 563.24 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 118.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 61.79 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 1071.04 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: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 1334.38 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: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB.
 * Witness Printer took 107.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 662]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L627]              int i = 0;
[L628]              int y = 0;
[L629]              List a = (List) malloc(sizeof(struct node));
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L630]  COND FALSE  !(a == 0)
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, y=0]
[L631]              List t;
[L632]              List p = a;
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]              i < 10 && __VERIFIER_nondet_int()
[L633]              i < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L633]  COND FALSE  !(i < 10 && __VERIFIER_nondet_int())
[L641]              y < 10 && __VERIFIER_nondet_int()
[L641]              y < 10 && __VERIFIER_nondet_int()
        VAL         [__VERIFIER_nondet_int()=0, a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0]
[L641]  COND FALSE  !(y < 10 && __VERIFIER_nondet_int())
[L649]              p->h = 3
[L650]              i = 0
[L651]              y = 0
[L652]              p = a
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]
[L653]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L653]  COND FALSE  !(p->h == 1)
[L657]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L657]  COND FALSE  !(p->h == 2)
[L661]  EXPR        p->h
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3, y=0]
[L661]  COND TRUE   p->h != 3 || (i + y) < 20
[L662]              __VERIFIER_error()
        VAL         [a={10:0}, i=0, malloc(sizeof(struct node))={10:0}, p={10:0}, y=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 42 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 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=40occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 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...