./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b87efc31cc381b9fe84243511097e1307d2087b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:49:32,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:49:32,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:49:32,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:49:32,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:49:32,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:49:32,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:49:32,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:49:32,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:49:32,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:49:32,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:49:32,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:49:32,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:49:32,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:49:32,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:49:32,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:49:32,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:49:32,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:49:32,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:49:32,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:49:32,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:49:32,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:49:32,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:49:32,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:49:32,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:49:32,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:49:32,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:49:32,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:49:32,377 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:49:32,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:49:32,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:49:32,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:49:32,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:49:32,379 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:49:32,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:49:32,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:49:32,380 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:49:32,391 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:49:32,391 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:49:32,391 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:49:32,392 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:49:32,392 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:49:32,392 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:49:32,392 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:49:32,392 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:49:32,392 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:49:32,393 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:49:32,393 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:49:32,393 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:49:32,393 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:49:32,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:49:32,395 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:49:32,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:49:32,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:49:32,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:49:32,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:49:32,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:49:32,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:49:32,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:49:32,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:49:32,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:49:32,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:49:32,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:49:32,398 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b87efc31cc381b9fe84243511097e1307d2087b [2018-11-22 21:49:32,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:49:32,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:49:32,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:49:32,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:49:32,438 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:49:32,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-22 21:49:32,485 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/data/5df09b625/d0df2631f6ee4492915d24e4e08a8e27/FLAG409f12d72 [2018-11-22 21:49:32,878 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:49:32,879 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/sv-benchmarks/c/list-ext3-properties/dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-22 21:49:32,889 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/data/5df09b625/d0df2631f6ee4492915d24e4e08a8e27/FLAG409f12d72 [2018-11-22 21:49:33,247 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/data/5df09b625/d0df2631f6ee4492915d24e4e08a8e27 [2018-11-22 21:49:33,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:49:33,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:49:33,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:49:33,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:49:33,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:49:33,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653d5bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33, skipping insertion in model container [2018-11-22 21:49:33,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:49:33,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:49:33,493 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:49:33,500 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:49:33,536 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:49:33,624 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:49:33,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33 WrapperNode [2018-11-22 21:49:33,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:49:33,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:49:33,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:49:33,625 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:49:33,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:49:33,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:49:33,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:49:33,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:49:33,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... [2018-11-22 21:49:33,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:49:33,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:49:33,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:49:33,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:49:33,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:49:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:49:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:49:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-22 21:49:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-22 21:49:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:49:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:49:33,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:49:33,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-22 21:49:33,714 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-22 21:49:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:49:33,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:49:33,933 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:49:33,933 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-22 21:49:33,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:49:33 BoogieIcfgContainer [2018-11-22 21:49:33,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:49:33,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:49:33,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:49:33,937 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:49:33,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:49:33" (1/3) ... [2018-11-22 21:49:33,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e8fa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:49:33, skipping insertion in model container [2018-11-22 21:49:33,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:49:33" (2/3) ... [2018-11-22 21:49:33,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e8fa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:49:33, skipping insertion in model container [2018-11-22 21:49:33,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:49:33" (3/3) ... [2018-11-22 21:49:33,939 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified_false-unreach-call_false-valid-memcleanup.i [2018-11-22 21:49:33,946 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:49:33,951 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:49:33,961 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:49:33,984 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:49:33,985 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:49:33,985 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:49:33,985 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:49:33,985 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:49:33,985 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:49:33,985 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:49:33,985 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:49:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-22 21:49:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:49:34,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:34,003 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] [2018-11-22 21:49:34,005 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:34,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:34,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1907175990, now seen corresponding path program 1 times [2018-11-22 21:49:34,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:34,104 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-22 21:49:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:49:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:49:34,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:49:34,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:49:34,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:49:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:49:34,121 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-22 21:49:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:34,136 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-22 21:49:34,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:49:34,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-22 21:49:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:34,151 INFO L225 Difference]: With dead ends: 62 [2018-11-22 21:49:34,151 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 21:49:34,154 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-22 21:49:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 21:49:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-22 21:49:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 21:49:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-22 21:49:34,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2018-11-22 21:49:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:34,183 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-22 21:49:34,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:49:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2018-11-22 21:49:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:49:34,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:34,184 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] [2018-11-22 21:49:34,184 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:34,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash -968359388, now seen corresponding path program 1 times [2018-11-22 21:49:34,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:34,257 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-22 21:49:34,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:49:34,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:49:34,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:49:34,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:49:34,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:49:34,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:49:34,259 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 5 states. [2018-11-22 21:49:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:34,306 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-11-22 21:49:34,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:49:34,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-22 21:49:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:34,308 INFO L225 Difference]: With dead ends: 56 [2018-11-22 21:49:34,308 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:49:34,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:49:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:49:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-22 21:49:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:49:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2018-11-22 21:49:34,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2018-11-22 21:49:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:34,319 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-22 21:49:34,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:49:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-22 21:49:34,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:49:34,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:34,319 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, 1, 1, 1, 1, 1] [2018-11-22 21:49:34,320 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:34,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 638407916, now seen corresponding path program 1 times [2018-11-22 21:49:34,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:34,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:34,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:49:34,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:49:34,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:49:34,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:49:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:49:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:49:34,388 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 3 states. [2018-11-22 21:49:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:34,405 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2018-11-22 21:49:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:49:34,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:49:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:34,407 INFO L225 Difference]: With dead ends: 63 [2018-11-22 21:49:34,407 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:49:34,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:49:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:49:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-22 21:49:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 21:49:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-22 21:49:34,412 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 27 [2018-11-22 21:49:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:34,412 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-22 21:49:34,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:49:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-22 21:49:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:49:34,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:34,413 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, 1, 1, 1, 1, 1] [2018-11-22 21:49:34,414 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:34,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash -372709334, now seen corresponding path program 1 times [2018-11-22 21:49:34,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:34,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:34,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:34,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:34,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:49:34,509 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-22 21:49:34,511 INFO L202 CegarAbsIntRunner]: [5], [6], [7], [14], [16], [22], [24], [27], [31], [36], [38], [42], [43], [47], [49], [54], [59], [64], [66], [69], [75], [111], [116], [117], [118], [120], [121] [2018-11-22 21:49:34,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:49:34,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:49:34,693 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 21:49:34,695 INFO L272 AbstractInterpreter]: Visited 16 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Performed 223 root evaluator evaluations with a maximum evaluation depth of 3. Performed 223 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-11-22 21:49:34,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:34,702 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 21:49:34,766 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 77.2% of their original sizes. [2018-11-22 21:49:34,766 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 21:49:34,816 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-22 21:49:34,816 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 21:49:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:49:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-22 21:49:34,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:49:34,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 21:49:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:49:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:49:34,818 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 9 states. [2018-11-22 21:49:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:35,165 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-11-22 21:49:35,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:49:35,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-22 21:49:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:35,166 INFO L225 Difference]: With dead ends: 65 [2018-11-22 21:49:35,166 INFO L226 Difference]: Without dead ends: 48 [2018-11-22 21:49:35,167 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:49:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-22 21:49:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-22 21:49:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-22 21:49:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-22 21:49:35,175 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 27 [2018-11-22 21:49:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:35,175 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-22 21:49:35,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 21:49:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-22 21:49:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 21:49:35,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:35,177 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:49:35,177 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:35,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash -802898906, now seen corresponding path program 1 times [2018-11-22 21:49:35,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:35,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:35,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:35,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:35,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:49:35,283 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-22 21:49:35,283 INFO L202 CegarAbsIntRunner]: [5], [6], [7], [14], [16], [22], [24], [27], [31], [34], [36], [38], [42], [43], [47], [49], [54], [59], [64], [66], [69], [75], [111], [116], [117], [118], [120], [121] [2018-11-22 21:49:35,285 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:49:35,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:49:35,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 21:49:35,353 INFO L272 AbstractInterpreter]: Visited 28 different actions 58 times. Merged at 10 different actions 24 times. Never widened. Performed 609 root evaluator evaluations with a maximum evaluation depth of 3. Performed 609 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-22 21:49:35,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:35,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 21:49:35,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:35,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:49:35,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:35,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:49:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:35,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:49:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:35,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:49:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:35,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:49:35,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-22 21:49:35,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:49:35,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:49:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:49:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:49:35,566 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 7 states. [2018-11-22 21:49:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:35,615 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-22 21:49:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:49:35,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-22 21:49:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:35,617 INFO L225 Difference]: With dead ends: 85 [2018-11-22 21:49:35,617 INFO L226 Difference]: Without dead ends: 68 [2018-11-22 21:49:35,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:49:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-22 21:49:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-11-22 21:49:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 21:49:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2018-11-22 21:49:35,624 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 34 [2018-11-22 21:49:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:35,624 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2018-11-22 21:49:35,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:49:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2018-11-22 21:49:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-22 21:49:35,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:35,625 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:49:35,626 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:35,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -150096726, now seen corresponding path program 2 times [2018-11-22 21:49:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:35,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:35,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:35,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:35,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:49:35,716 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 21:49:35,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:49:35,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:35,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:49:35,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:49:35,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 21:49:35,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-22 21:49:35,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:49:35,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:49:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:35,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:49:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:36,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:49:36,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-22 21:49:36,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:49:36,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:49:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:49:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:49:36,031 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 8 states. [2018-11-22 21:49:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:36,070 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2018-11-22 21:49:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:49:36,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-22 21:49:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:36,072 INFO L225 Difference]: With dead ends: 99 [2018-11-22 21:49:36,072 INFO L226 Difference]: Without dead ends: 82 [2018-11-22 21:49:36,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:49:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-22 21:49:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-22 21:49:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-22 21:49:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-22 21:49:36,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 41 [2018-11-22 21:49:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-22 21:49:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:49:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-22 21:49:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 21:49:36,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:36,082 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:49:36,082 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:36,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1857609638, now seen corresponding path program 3 times [2018-11-22 21:49:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:36,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:49:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:36,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:36,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:36,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:49:36,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 21:49:36,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:49:36,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:36,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:49:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 21:49:36,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 21:49:36,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 21:49:36,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:49:36,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:49:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:36,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:49:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:49:36,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:49:36,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-11-22 21:49:36,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:49:36,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 21:49:36,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:49:36,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:49:36,388 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2018-11-22 21:49:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:36,433 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2018-11-22 21:49:36,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:49:36,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-22 21:49:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:36,434 INFO L225 Difference]: With dead ends: 113 [2018-11-22 21:49:36,434 INFO L226 Difference]: Without dead ends: 96 [2018-11-22 21:49:36,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:49:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-22 21:49:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-11-22 21:49:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-22 21:49:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2018-11-22 21:49:36,442 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 48 [2018-11-22 21:49:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:36,442 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2018-11-22 21:49:36,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 21:49:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2018-11-22 21:49:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 21:49:36,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:36,444 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:49:36,444 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:36,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1135780138, now seen corresponding path program 4 times [2018-11-22 21:49:36,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:36,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:49:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:36,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 21:49:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:36,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:49:36,705 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 21:49:36,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:49:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:49:36,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:49:36,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:36,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:49:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:49:36,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:49:36,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-22 21:49:36,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-22 21:49:36,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-22 21:49:36,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-22 21:49:36,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 21:49:36,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-22 21:49:36,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-22 21:49:36,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:24, output treesize:24 [2018-11-22 21:49:36,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:36,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:36,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-22 21:49:36,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2018-11-22 21:49:36,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 85 [2018-11-22 21:49:36,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 21:49:36,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-11-22 21:49:36,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,929 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:67, output treesize:24 [2018-11-22 21:49:36,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 21:49:36,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-22 21:49:36,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:36,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:20 [2018-11-22 21:49:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-22 21:49:37,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:49:37,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-11-22 21:49:37,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:37,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:37,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 21:49:37,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-22 21:49:37,642 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:57 [2018-11-22 21:49:39,681 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-22 21:49:39,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 21:49:39,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 21:49:39,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2018-11-22 21:49:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-22 21:49:39,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:49:39,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 30 [2018-11-22 21:49:39,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:49:39,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-22 21:49:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-22 21:49:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=770, Unknown=1, NotChecked=0, Total=870 [2018-11-22 21:49:39,747 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand 20 states. [2018-11-22 21:49:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:49:40,077 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2018-11-22 21:49:40,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 21:49:40,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-22 21:49:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:49:40,078 INFO L225 Difference]: With dead ends: 108 [2018-11-22 21:49:40,078 INFO L226 Difference]: Without dead ends: 95 [2018-11-22 21:49:40,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=197, Invalid=1208, Unknown=1, NotChecked=0, Total=1406 [2018-11-22 21:49:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-22 21:49:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2018-11-22 21:49:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-22 21:49:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2018-11-22 21:49:40,089 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 55 [2018-11-22 21:49:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:49:40,090 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-22 21:49:40,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-22 21:49:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-22 21:49:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 21:49:40,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:49:40,091 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:49:40,091 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:49:40,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:49:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1135782060, now seen corresponding path program 1 times [2018-11-22 21:49:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:49:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:49:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:49:40,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:49:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:49:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:49:40,186 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=60, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] RET #117#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~0 := 5; VAL [main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=5] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=5] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=4] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=4] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=3] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=3] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=2] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=2] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=1] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=1] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#res.base|=54, |dll_create_#res.offset|=0, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume true; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#res.base|=54, |dll_create_#res.offset|=0, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] RET #121#return; VAL [main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6.base|=54, |main_#t~ret6.offset|=0] [?] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem13.base|=69, |main_#t~mem13.offset|=0] [?] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~short9|=false] [?] assume !#t~short9;call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4);#t~short9 := 0 != #t~mem8; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short9|=false] [?] #t~short11 := #t~short9; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short11|=false, |main_#t~short9|=false] [?] assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short11|=true, |main_#t~short9|=false] [?] assume #t~short11;havoc #t~short9;havoc #t~mem8;havoc #t~mem7;havoc #t~short11;havoc #t~mem10; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=60, old(#NULL.base)=43, old(#NULL.offset)=60] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L588] ~len~0 := 5; VAL [#NULL.base=0, #NULL.offset=0, ~len~0=5] [L589] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L579-L581] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=47, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=29, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=71, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=69, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L569-L584] assume !(~len > 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L585] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L567-L586] ensures true; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L589] RET call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.base=54, #t~ret6.offset=0, ~len~0=5] [L589] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset; [L589] havoc #t~ret6.base, #t~ret6.offset; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem13.base=69, #t~mem13.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590-L595] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L590] havoc #t~mem13.base, #t~mem13.offset; [L591] call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short9; [L591] call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short11; [L591] call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591-L593] assume #t~short11; [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L605] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=60, old(#NULL.base)=43, old(#NULL.offset)=60] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L588] ~len~0 := 5; VAL [#NULL.base=0, #NULL.offset=0, ~len~0=5] [L589] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L579-L581] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=47, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=29, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=71, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=69, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L569-L584] assume !(~len > 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L585] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L567-L586] ensures true; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L589] RET call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.base=54, #t~ret6.offset=0, ~len~0=5] [L589] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset; [L589] havoc #t~ret6.base, #t~ret6.offset; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem13.base=69, #t~mem13.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590-L595] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L590] havoc #t~mem13.base, #t~mem13.offset; [L591] call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short9; [L591] call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short11; [L591] call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591-L593] assume #t~short11; [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L605] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L585] return head; VAL [\old(len)=5, \result={54:0}, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={54:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={54:0}, head->next={69:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={54:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={54:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={54:0}, len=5] ----- [2018-11-22 21:49:40,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:49:40 BoogieIcfgContainer [2018-11-22 21:49:40,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:49:40,368 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:49:40,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:49:40,369 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:49:40,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:49:33" (3/4) ... [2018-11-22 21:49:40,371 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|=43, |#NULL.offset|=60, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=60] [?] RET #117#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~0 := 5; VAL [main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=5] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=5] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [dll_create_~head~0.base=0, dll_create_~head~0.offset=0, dll_create_~len=5, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=47, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=47, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=4] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=4] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=47, dll_create_~head~0.offset=0, dll_create_~len=4, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=29, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=29, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=3] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=3] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=29, dll_create_~head~0.offset=0, dll_create_~len=3, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=71, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=71, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=2] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=2] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=71, dll_create_~head~0.offset=0, dll_create_~len=2, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=69, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=69, |dll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4);call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=1] [?] assume #t~nondet3 == ~len;#t~ite4 := 1; VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~ite4|=1, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0, |dll_create_#t~nondet3|=1] [?] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4);havoc #t~nondet3;havoc #t~ite4;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [dll_create_~head~0.base=69, dll_create_~head~0.offset=0, dll_create_~len=1, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#res.base|=54, |dll_create_#res.offset|=0, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] assume true; VAL [dll_create_~head~0.base=54, dll_create_~head~0.offset=0, dll_create_~len=0, dll_create_~new_head~0.base=54, dll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |dll_create_#in~len|=5, |dll_create_#res.base|=54, |dll_create_#res.offset|=0, |dll_create_#t~malloc2.base|=54, |dll_create_#t~malloc2.offset|=0] [?] RET #121#return; VAL [main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6.base|=54, |main_#t~ret6.offset|=0] [?] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem13.base|=69, |main_#t~mem13.offset|=0] [?] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem13.base, #t~mem13.offset;call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4);#t~short9 := 0 != #t~mem7; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~short9|=false] [?] assume !#t~short9;call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4);#t~short9 := 0 != #t~mem8; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short9|=false] [?] #t~short11 := #t~short9; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short11|=false, |main_#t~short9|=false] [?] assume !#t~short11;call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4);#t~short11 := 0 != #t~mem10; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_#t~mem7|=0, |main_#t~mem8|=0, |main_#t~short11|=true, |main_#t~short9|=false] [?] assume #t~short11;havoc #t~short9;havoc #t~mem8;havoc #t~mem7;havoc #t~short11;havoc #t~mem10; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~head~1.base=54, main_~head~1.offset=0, main_~len~0=5, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=60, old(#NULL.base)=43, old(#NULL.offset)=60] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L588] ~len~0 := 5; VAL [#NULL.base=0, #NULL.offset=0, ~len~0=5] [L589] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L579-L581] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=47, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=29, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=71, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=69, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L569-L584] assume !(~len > 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L585] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L567-L586] ensures true; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L589] RET call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.base=54, #t~ret6.offset=0, ~len~0=5] [L589] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset; [L589] havoc #t~ret6.base, #t~ret6.offset; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem13.base=69, #t~mem13.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590-L595] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L590] havoc #t~mem13.base, #t~mem13.offset; [L591] call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short9; [L591] call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short11; [L591] call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591-L593] assume #t~short11; [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L605] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=60, old(#NULL.base)=43, old(#NULL.offset)=60] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L588] ~len~0 := 5; VAL [#NULL.base=0, #NULL.offset=0, ~len~0=5] [L589] CALL call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=47, #t~malloc2.offset=0, #t~nondet3=5, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L579-L581] assume !(~head~0.base != 0 || ~head~0.offset != 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=5, ~new_head~0.base=47, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=47, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=47, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet3=4, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=47, ~head~0.offset=0, ~len=4, ~new_head~0.base=29, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=29, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=71, #t~malloc2.offset=0, #t~nondet3=3, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=29, ~head~0.offset=0, ~len=3, ~new_head~0.base=71, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=71, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=71, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=69, #t~malloc2.offset=0, #t~nondet3=2, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=71, ~head~0.offset=0, ~len=2, ~new_head~0.base=69, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=69, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=69, ~new_head~0.offset=0] [L569-L584] assume !!(~len > 0); [L570] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(20); [L570] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L571-L573] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L574] call write~int(0, ~new_head~0.base, ~new_head~0.offset, 4); [L575] call write~int(0, ~new_head~0.base, 8 + ~new_head~0.offset, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] assume #t~nondet3 == ~len; [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~ite4=1, #t~malloc2.base=54, #t~malloc2.offset=0, #t~nondet3=1, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L576] call write~int(#t~ite4, ~new_head~0.base, 16 + ~new_head~0.offset, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4); [L578] call write~$Pointer$(0, 0, ~new_head~0.base, 12 + ~new_head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L579-L581] assume ~head~0.base != 0 || ~head~0.offset != 0; [L580] call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, 12 + ~head~0.offset, 4); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=69, ~head~0.offset=0, ~len=1, ~new_head~0.base=54, ~new_head~0.offset=0] [L582] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L569-L584] assume !(~len > 0); VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L585] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L567-L586] ensures true; VAL [#in~len=5, #NULL.base=0, #NULL.offset=0, #res.base=54, #res.offset=0, #t~malloc2.base=54, #t~malloc2.offset=0, ~head~0.base=54, ~head~0.offset=0, ~len=0, ~new_head~0.base=54, ~new_head~0.offset=0] [L589] RET call #t~ret6.base, #t~ret6.offset := dll_create(~len~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.base=54, #t~ret6.offset=0, ~len~0=5] [L589] ~head~1.base, ~head~1.offset := #t~ret6.base, #t~ret6.offset; [L589] havoc #t~ret6.base, #t~ret6.offset; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head~1.base, 4 + ~head~1.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem13.base=69, #t~mem13.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L590-L595] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L590] havoc #t~mem13.base, #t~mem13.offset; [L591] call #t~mem7 := read~int(~head~1.base, ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short9; [L591] call #t~mem8 := read~int(~head~1.base, 8 + ~head~1.offset, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591] assume !#t~short11; [L591] call #t~mem10 := read~int(~head~1.base, 16 + ~head~1.offset, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L591-L593] assume #t~short11; [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [L605] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~head~1.base=54, ~head~1.offset=0, ~len~0=5] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=60, old(#NULL!base)=43, old(#NULL!offset)=60] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=60] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L588] ~len~0 := 5; VAL [#NULL!base=0, #NULL!offset=0, ~len~0=5] [L589] CALL call #t~ret6 := dll_create(~len~0); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0] [L567-L586] ~len := #in~len; [L568] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=47, #t~malloc2!offset=0, #t~nondet3=5, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L579-L581] COND FALSE !(~head~0 != { base: 0, offset: 0 }) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=5, ~new_head~0!base=47, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=47, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=47, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet3=4, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=47, ~head~0!offset=0, ~len=4, ~new_head~0!base=29, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=29, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=71, #t~malloc2!offset=0, #t~nondet3=3, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=29, ~head~0!offset=0, ~len=3, ~new_head~0!base=71, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=71, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=71, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=69, #t~malloc2!offset=0, #t~nondet3=2, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=71, ~head~0!offset=0, ~len=2, ~new_head~0!base=69, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=69, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=69, ~new_head~0!offset=0] [L569-L584] COND FALSE !(!(~len > 0)) [L570] FCALL call #t~malloc2 := #Ultimate.alloc(20); [L570] ~new_head~0 := #t~malloc2; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L571] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L574] FCALL call write~int(0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L575] FCALL call write~int(0, { base: ~new_head~0!base, offset: 8 + ~new_head~0!offset }, 4); [L576] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] COND TRUE #t~nondet3 == ~len [L576] #t~ite4 := 1; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~ite4=1, #t~malloc2!base=54, #t~malloc2!offset=0, #t~nondet3=1, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L576] FCALL call write~int(#t~ite4, { base: ~new_head~0!base, offset: 16 + ~new_head~0!offset }, 4); [L576] havoc #t~nondet3; [L576] havoc #t~ite4; [L577] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: 4 + ~new_head~0!offset }, 4); [L578] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~new_head~0!base, offset: 12 + ~new_head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L579-L581] COND TRUE ~head~0 != { base: 0, offset: 0 } [L580] FCALL call write~$Pointer$(~new_head~0, { base: ~head~0!base, offset: 12 + ~head~0!offset }, 4); VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=69, ~head~0!offset=0, ~len=1, ~new_head~0!base=54, ~new_head~0!offset=0] [L582] ~head~0 := ~new_head~0; [L583] #t~post5 := ~len; [L583] ~len := #t~post5 - 1; [L583] havoc #t~post5; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L569-L584] COND TRUE !(~len > 0) VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L585] #res := ~head~0; VAL [#in~len=5, #NULL!base=0, #NULL!offset=0, #res!base=54, #res!offset=0, #t~malloc2!base=54, #t~malloc2!offset=0, ~head~0!base=54, ~head~0!offset=0, ~len=0, ~new_head~0!base=54, ~new_head~0!offset=0] [L589] RET call #t~ret6 := dll_create(~len~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!base=54, #t~ret6!offset=0, ~len~0=5] [L589] ~head~1 := #t~ret6; [L589] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590] FCALL call #t~mem13 := read~$Pointer$({ base: ~head~1!base, offset: 4 + ~head~1!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem13!base=69, #t~mem13!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L590-L595] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L590] havoc #t~mem13; [L591] FCALL call #t~mem7 := read~int({ base: ~head~1!base, offset: ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short9) [L591] FCALL call #t~mem8 := read~int({ base: ~head~1!base, offset: 8 + ~head~1!offset }, 4); [L591] #t~short9 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] #t~short11 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, #t~short11=false, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND FALSE !(#t~short11) [L591] FCALL call #t~mem10 := read~int({ base: ~head~1!base, offset: 16 + ~head~1!offset }, 4); [L591] #t~short11 := 0 != #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, #t~mem7=0, #t~mem8=0, #t~short11=true, #t~short9=false, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L591] COND TRUE #t~short11 [L591] havoc #t~short9; [L591] havoc #t~mem8; [L591] havoc #t~mem7; [L591] havoc #t~short11; [L591] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L605] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~head~1!base=54, ~head~1!offset=0, ~len~0=5] [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L585] return head; VAL [\old(len)=5, \result={54:0}, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={54:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={54:0}, head->next={69:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={54:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={54:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={54:0}, len=5] ----- [2018-11-22 21:49:40,799 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_20a6a995-742e-470e-b8a1-5e0225bc3b1d/bin-2019/utaipan/witness.graphml [2018-11-22 21:49:40,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:49:40,800 INFO L168 Benchmark]: Toolchain (without parser) took 7549.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 955.4 MB in the beginning and 829.1 MB in the end (delta: 126.3 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,801 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:49:40,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,802 INFO L168 Benchmark]: Boogie Preprocessor took 25.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,802 INFO L168 Benchmark]: RCFGBuilder took 261.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,803 INFO L168 Benchmark]: TraceAbstraction took 6433.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 840.9 MB in the end (delta: 282.3 MB). Peak memory consumption was 346.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,813 INFO L168 Benchmark]: Witness Printer took 430.59 ms. Allocated memory is still 1.3 GB. Free memory was 840.9 MB in the beginning and 829.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:49:40,818 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -202.2 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 261.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6433.44 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 840.9 MB in the end (delta: 282.3 MB). Peak memory consumption was 346.7 MB. Max. memory is 11.5 GB. * Witness Printer took 430.59 ms. Allocated memory is still 1.3 GB. Free memory was 840.9 MB in the beginning and 829.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 605]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L588] const int len = 5; VAL [len=5] [L589] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L568] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L579] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={47:0}, new_head={47:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={47:0}, len=4, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={29:0}, new_head={29:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={29:0}, len=3, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={71:0}, new_head={71:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={71:0}, len=2, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={69:0}, new_head={69:0}] [L569] COND TRUE len > 0 [L570] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L571] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L574] new_head->data_0 = 0 [L575] new_head->data_1 = 0 [L576] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L576] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L577] new_head->next = head [L578] new_head->prev = ((void *)0) VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L579] COND TRUE \read(head) [L580] head->prev = new_head VAL [\old(len)=5, head={69:0}, len=1, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L582] head = new_head [L583] len-- VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L569] COND FALSE !(len > 0) VAL [\old(len)=5, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L585] return head; VAL [\old(len)=5, \result={54:0}, head={54:0}, len=0, malloc(sizeof(struct node))={54:0}, new_head={54:0}] [L589] RET, EXPR dll_create(len) VAL [dll_create(len)={54:0}, len=5] [L589] DLL head = dll_create(len); [L590] head->next VAL [head={54:0}, head->next={69:0}, len=5] [L590] COND TRUE head->next [L591] EXPR head->data_0 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 [L591] EXPR head->data_1 [L591] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={54:0}, head->data_0=0, head->data_1=0, len=5] [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L591] EXPR head->data_2 [L591] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={54:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L591] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L605] __VERIFIER_error() VAL [head={54:0}, len=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 1 error locations. UNSAFE Result, 6.3s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 289 SDtfs, 309 SDslu, 1064 SDs, 0 SdLazy, 466 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 450 GetRequests, 351 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9312271062271062 AbsIntWeakeningRatio, 1.2307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 0.8846153846153846 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 505 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 612 ConstructedInterpolants, 3 QuantifiedInterpolants, 102322 SizeOfPredicates, 25 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 187/464 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...