./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search_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_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:36:56,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:36:56,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:36:56,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:36:56,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:36:56,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:36:56,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:36:56,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:36:56,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:36:56,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:36:56,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:36:56,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:36:56,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:36:56,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:36:56,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:36:56,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:36:56,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:36:56,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:36:56,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:36:56,277 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:36:56,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:36:56,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:36:56,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:36:56,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:36:56,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:36:56,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:36:56,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:36:56,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:36:56,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:36:56,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:36:56,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:36:56,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:36:56,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:36:56,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:36:56,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:36:56,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:36:56,287 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:36:56,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:36:56,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:36:56,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:36:56,299 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:36:56,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:36:56,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:36:56,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:36:56,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:36:56,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:36:56,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:36:56,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:36:56,303 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:36:56,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:36:56,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-11-23 14:36:56,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:36:56,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:36:56,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:36:56,343 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:36:56,343 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:36:56,344 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 14:36:56,395 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/data/b35571f93/adc63209b8024bea8bebe681b61e48cf/FLAG8a058d593 [2018-11-23 14:36:56,901 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:36:56,901 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 14:36:56,912 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/data/b35571f93/adc63209b8024bea8bebe681b61e48cf/FLAG8a058d593 [2018-11-23 14:36:57,175 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/data/b35571f93/adc63209b8024bea8bebe681b61e48cf [2018-11-23 14:36:57,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:36:57,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:36:57,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:36:57,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:36:57,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:36:57,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56501d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57, skipping insertion in model container [2018-11-23 14:36:57,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:36:57,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:36:57,575 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:36:57,588 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:36:57,638 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:36:57,772 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:36:57,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57 WrapperNode [2018-11-23 14:36:57,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:36:57,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:36:57,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:36:57,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:36:57,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:36:57,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:36:57,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:36:57,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:36:57,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 14:36:57,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:36:57,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:36:57,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:36:57,840 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:36:57,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:36:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-23 14:36:57,888 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-23 14:36:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:36:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:36:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 14:36:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 14:36:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:36:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:36:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:36:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:36:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:36:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 14:36:57,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 14:36:57,890 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-23 14:36:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-23 14:36:57,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:36:57,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:36:57,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:36:58,358 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:36:58,358 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:36:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:58 BoogieIcfgContainer [2018-11-23 14:36:58,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:36:58,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:36:58,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:36:58,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:36:58,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:57" (1/3) ... [2018-11-23 14:36:58,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbd38a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:58, skipping insertion in model container [2018-11-23 14:36:58,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (2/3) ... [2018-11-23 14:36:58,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbd38a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:58, skipping insertion in model container [2018-11-23 14:36:58,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:58" (3/3) ... [2018-11-23 14:36:58,372 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 14:36:58,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:36:58,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:36:58,402 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:36:58,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:36:58,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:36:58,427 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:36:58,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:36:58,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:36:58,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:36:58,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:36:58,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:36:58,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:36:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 14:36:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 14:36:58,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:36:58,456 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1] [2018-11-23 14:36:58,458 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:36:58,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:36:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash -658334123, now seen corresponding path program 1 times [2018-11-23 14:36:58,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:36:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:36:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:58,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:36:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 14:36:58,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:36:58,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:36:58,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:36:59,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:36:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 14:36:59,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 14:36:59,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-23 14:36:59,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:36:59,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:36:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:36:59,181 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 6 states. [2018-11-23 14:36:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:36:59,781 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2018-11-23 14:36:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 14:36:59,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-23 14:36:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:36:59,791 INFO L225 Difference]: With dead ends: 95 [2018-11-23 14:36:59,792 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 14:36:59,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:36:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 14:36:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-11-23 14:36:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 14:36:59,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 14:36:59,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 45 [2018-11-23 14:36:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:36:59,846 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 14:36:59,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:36:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 14:36:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 14:36:59,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:36:59,851 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:36:59,851 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:36:59,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:36:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 369290796, now seen corresponding path program 1 times [2018-11-23 14:36:59,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:36:59,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:36:59,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:59,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:36:59,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:36:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:37:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:37:00,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:37:00,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 14:37:00,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 14:37:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 14:37:00,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:37:00,421 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 10 states. [2018-11-23 14:37:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:37:00,982 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 14:37:00,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:37:00,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 14:37:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:37:00,987 INFO L225 Difference]: With dead ends: 56 [2018-11-23 14:37:00,987 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 14:37:00,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:37:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 14:37:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-23 14:37:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 14:37:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 14:37:00,998 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 47 [2018-11-23 14:37:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:37:00,998 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 14:37:00,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 14:37:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 14:37:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 14:37:01,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:37:01,000 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:37:01,001 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:37:01,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:37:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -23736214, now seen corresponding path program 1 times [2018-11-23 14:37:01,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:37:01,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:37:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:37:01,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:37:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:37:01,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:37:01,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:37:01,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:37:01,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:37:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:37:01,221 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 7 states. [2018-11-23 14:37:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:37:01,541 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 14:37:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 14:37:01,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 14:37:01,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:37:01,544 INFO L225 Difference]: With dead ends: 54 [2018-11-23 14:37:01,545 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 14:37:01,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:37:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 14:37:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 14:37:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 14:37:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 14:37:01,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 47 [2018-11-23 14:37:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:37:01,554 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 14:37:01,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:37:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 14:37:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 14:37:01,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:37:01,555 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1] [2018-11-23 14:37:01,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:37:01,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:37:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1979191460, now seen corresponding path program 1 times [2018-11-23 14:37:01,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:37:01,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:37:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:01,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:37:01,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:37:01,974 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2018-11-23 14:37:02,682 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-23 14:37:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 14:37:03,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:37:03,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:37:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:37:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:37:03,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:37:03,567 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-23 14:37:03,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 14:37:03,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 22 treesize of output 19 [2018-11-23 14:37:03,619 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 19 treesize of output 22 [2018-11-23 14:37:03,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:03,640 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 22 treesize of output 14 [2018-11-23 14:37:03,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-11-23 14:37:03,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:37:03,850 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 10 treesize of output 9 [2018-11-23 14:37:03,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:37:03,875 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 10 treesize of output 9 [2018-11-23 14:37:03,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:03,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:37:03,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-11-23 14:37:05,377 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 14:37:06,010 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 14:37:06,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:06,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:06,026 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 17 treesize of output 10 [2018-11-23 14:37:06,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,039 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 43 [2018-11-23 14:37:06,042 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 19 treesize of output 22 [2018-11-23 14:37:06,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:06,045 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 22 treesize of output 14 [2018-11-23 14:37:06,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:36 [2018-11-23 14:37:06,691 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 14:37:06,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:06,693 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-23 14:37:06,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:1 [2018-11-23 14:37:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 14:37:06,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:37:06,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 30 [2018-11-23 14:37:06,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 14:37:06,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 14:37:06,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=780, Unknown=1, NotChecked=0, Total=870 [2018-11-23 14:37:06,725 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 30 states. [2018-11-23 14:37:08,261 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-23 14:37:10,842 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-11-23 14:37:12,133 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-11-23 14:37:14,255 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-11-23 14:37:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:37:14,835 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-23 14:37:14,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 14:37:14,835 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2018-11-23 14:37:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:37:14,836 INFO L225 Difference]: With dead ends: 66 [2018-11-23 14:37:14,836 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 14:37:14,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=250, Invalid=2005, Unknown=1, NotChecked=0, Total=2256 [2018-11-23 14:37:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 14:37:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 14:37:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 14:37:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 14:37:14,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 50 [2018-11-23 14:37:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:37:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 14:37:14,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 14:37:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 14:37:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 14:37:14,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:37:14,847 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:37:14,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:37:14,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:37:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -596828116, now seen corresponding path program 2 times [2018-11-23 14:37:14,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:37:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:37:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:14,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:37:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:37:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:37:15,757 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-11-23 14:37:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:37:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:37:16,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:37:16,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 14:37:16,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 14:37:16,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 14:37:16,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:37:16,405 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-23 14:37:16,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 14:37:16,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 22 treesize of output 19 [2018-11-23 14:37:16,441 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 19 treesize of output 22 [2018-11-23 14:37:16,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:16,457 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 22 treesize of output 14 [2018-11-23 14:37:16,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2018-11-23 14:37:16,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:37:16,622 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 10 treesize of output 9 [2018-11-23 14:37:16,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:37:16,641 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 10 treesize of output 9 [2018-11-23 14:37:16,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:16,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:37:16,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-11-23 14:37:17,144 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 14:37:17,578 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-23 14:37:17,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:17,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:17,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 39 [2018-11-23 14:37:17,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,604 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 43 [2018-11-23 14:37:17,607 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 19 treesize of output 22 [2018-11-23 14:37:17,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:17,611 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 22 treesize of output 14 [2018-11-23 14:37:17,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-11-23 14:37:17,772 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-23 14:37:17,776 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-23 14:37:17,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:17,844 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:37:17,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:37:17,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 14:37:17,865 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:117, output treesize:63 [2018-11-23 14:37:29,026 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 14:37:32,340 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 14:37:32,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 14:37:32,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 39 [2018-11-23 14:37:32,418 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 19 treesize of output 22 [2018-11-23 14:37:32,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,423 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 22 treesize of output 14 [2018-11-23 14:37:32,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 59 [2018-11-23 14:37:32,463 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 28 treesize of output 27 [2018-11-23 14:37:32,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-23 14:37:32,468 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-23 14:37:32,503 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-23 14:37:32,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:37:32,516 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-23 14:37:32,516 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,523 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,528 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:32,541 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:103, output treesize:77 [2018-11-23 14:37:33,149 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 14:37:33,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:37:33,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:37:33,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:114, output treesize:1 [2018-11-23 14:37:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:37:33,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:37:33,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 42 [2018-11-23 14:37:33,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 14:37:33,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 14:37:33,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1595, Unknown=8, NotChecked=0, Total=1722 [2018-11-23 14:37:33,217 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 42 states. [2018-11-23 14:37:39,235 WARN L180 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-11-23 14:37:43,898 WARN L180 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-11-23 14:37:48,347 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-11-23 14:37:56,726 WARN L180 SmtUtils]: Spent 4.80 s on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-11-23 14:38:01,653 WARN L180 SmtUtils]: Spent 4.87 s on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2018-11-23 14:38:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:38:06,021 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-23 14:38:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 14:38:06,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-11-23 14:38:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:38:06,022 INFO L225 Difference]: With dead ends: 70 [2018-11-23 14:38:06,022 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 14:38:06,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=319, Invalid=3213, Unknown=8, NotChecked=0, Total=3540 [2018-11-23 14:38:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 14:38:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-23 14:38:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 14:38:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-23 14:38:06,031 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 53 [2018-11-23 14:38:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:38:06,031 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-23 14:38:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 14:38:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-23 14:38:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 14:38:06,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:38:06,033 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2018-11-23 14:38:06,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:38:06,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:38:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -989855126, now seen corresponding path program 1 times [2018-11-23 14:38:06,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:38:06,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:38:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:38:06,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 14:38:06,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:38:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:38:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:38:06,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:38:06,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:38:06,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:38:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:38:06,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:38:06,529 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-23 14:38:06,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 14:38:06,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:38:06,547 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 10 treesize of output 9 [2018-11-23 14:38:06,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 14:38:06,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 10 [2018-11-23 14:38:06,623 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 10 treesize of output 9 [2018-11-23 14:38:06,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:38:06,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:38:06,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,650 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:06,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:38:06,656 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:34 [2018-11-23 14:38:07,472 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 14:38:07,931 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 14:38:07,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:38:07,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:38:07,938 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-23 14:38:07,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:07,957 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 27 treesize of output 28 [2018-11-23 14:38:07,959 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-23 14:38:07,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 14:38:07,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 14:38:07,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:38:07,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:07,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:07,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:38:07,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:39 [2018-11-23 14:38:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 14:38:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:38:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 32 [2018-11-23 14:38:08,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 14:38:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 14:38:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=899, Unknown=1, NotChecked=0, Total=992 [2018-11-23 14:38:08,139 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 32 states. [2018-11-23 14:38:09,154 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-11-23 14:38:11,090 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-11-23 14:38:11,998 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-23 14:38:12,942 WARN L180 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-23 14:38:14,852 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-11-23 14:38:15,854 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-11-23 14:38:17,982 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-11-23 14:38:19,147 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-11-23 14:38:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:38:19,546 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-11-23 14:38:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 14:38:19,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2018-11-23 14:38:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:38:19,547 INFO L225 Difference]: With dead ends: 76 [2018-11-23 14:38:19,547 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 14:38:19,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=383, Invalid=2586, Unknown=1, NotChecked=0, Total=2970 [2018-11-23 14:38:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 14:38:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-23 14:38:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 14:38:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-11-23 14:38:19,557 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2018-11-23 14:38:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:38:19,557 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-11-23 14:38:19,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 14:38:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 14:38:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 14:38:19,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:38:19,558 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2018-11-23 14:38:19,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:38:19,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:38:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1243118940, now seen corresponding path program 3 times [2018-11-23 14:38:19,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:38:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:38:19,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:38:19,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:38:19,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:38:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:38:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:38:19,634 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=24, |#NULL.offset|=20, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=0, ~head~0.offset=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=0, ~head~0.offset=0] [?] RET #74#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] RET #78#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] RET #80#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] RET #82#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] RET #84#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=3, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=1, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=5, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=2, |search_list_#t~short1|=false, ~head~0.base=17, ~head~0.offset=0] [?] assume !#t~short1;havoc #t~short1;havoc #t~mem0; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #res.base, #res.offset := ~l.base, ~l.offset; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#res.base|=30, |search_list_#res.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume true; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#res.base|=30, |search_list_#res.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] RET #86#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8.base|=30, |main_#t~ret8.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, main_~temp~0.base=30, main_~temp~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem9|=2, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=24, #NULL.offset=20, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L623] ~head~0.base, ~head~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0.base, ~mylist~0.offset; [L645] havoc ~temp~0.base, ~temp~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L634-L639] assume ~head~0.base == 0 && ~head~0.offset == 0; [L635] call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L624-L630] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L624-L630] ~k := #in~k; [L625] ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=3, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=5, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=2, #t~short1=false, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626-L628] assume !#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L629] #res.base, #res.offset := ~l.base, ~l.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L624-L630] ensures true; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L650] RET call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=30, #t~ret8.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset; [L650] havoc #t~ret8.base, #t~ret8.offset; [L651] call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=2, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32, ~temp~0.base=30, ~temp~0.offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=24, #NULL.offset=20, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L623] ~head~0.base, ~head~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0.base, ~mylist~0.offset; [L645] havoc ~temp~0.base, ~temp~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L634-L639] assume ~head~0.base == 0 && ~head~0.offset == 0; [L635] call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L624-L630] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L624-L630] ~k := #in~k; [L625] ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=3, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=5, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=2, #t~short1=false, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626-L628] assume !#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L629] #res.base, #res.offset := ~l.base, ~l.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L624-L630] ensures true; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L650] RET call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=30, #t~ret8.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset; [L650] havoc #t~ret8.base, #t~ret8.offset; [L651] call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=2, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32, ~temp~0.base=30, ~temp~0.offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L623] mlist *head; VAL [\old(head)=23, \old(head)=36, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L634] COND TRUE head==((void *)0) [L635] l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={30:0}, k=2, l={16:32}, l={30:0}, malloc(sizeof(mlist))={30:0}] [L646] RET insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={30:0}, insert_list(mylist,2)=0, mylist={16:32}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, k=5, l={16:32}, l={31:0}, malloc(sizeof(mlist))={31:0}] [L640] head = l [L641] return 0; VAL [\old(head)=30, \old(head)=0, \old(k)=5, \result=0, head={31:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L647] RET insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={31:0}, insert_list(mylist,5)=0, mylist={16:32}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=31, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=31, \old(k)=1, \result=0, head={15:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L648] RET insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,1)=0, mylist={16:32}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=0, \old(head)=15, \old(k)=3, head={15:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=15, \old(k)=3, \result=0, head={17:0}, k=3, l={16:32}, l={17:0}, malloc(sizeof(mlist))={17:0}] [L649] RET insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={17:0}, insert_list(mylist,3)=0, mylist={16:32}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, l={17:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={15:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={31:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={30:0}, l={17:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={30:0}, head={17:0}, k=2, l={30:0}, l={17:0}] [L650] RET, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, search_list(head,2)={30:0}] [L650] temp = search_list(head,2) [L651] EXPR temp->key VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, temp={30:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={17:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] ----- [2018-11-23 14:38:19,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:38:19 BoogieIcfgContainer [2018-11-23 14:38:19,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:38:19,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:38:19,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:38:19,812 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:38:19,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:58" (3/4) ... [2018-11-23 14:38:19,814 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|=24, |#NULL.offset|=20, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=0, ~head~0.offset=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=24, |old(#NULL.offset)|=20, |old(~head~0.base)|=36, |old(~head~0.offset)|=23, ~head~0.base=0, ~head~0.offset=0] [?] RET #74#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=0, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=2, insert_list_~l.base=30, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=2, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=30, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] RET #78#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=30, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=5, insert_list_~l.base=31, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=5, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=31, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=30, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] RET #80#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=31, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=1, insert_list_~l.base=15, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=1, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=15, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=31, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] RET #82#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [|#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=15, ~head~0.offset=0] [?] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume true; VAL [insert_list_~k=3, insert_list_~l.base=17, insert_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |insert_list_#in~k|=3, |insert_list_#in~l.base|=16, |insert_list_#in~l.offset|=32, |insert_list_#res|=0, |insert_list_#t~malloc3.base|=17, |insert_list_#t~malloc3.offset|=0, |old(~head~0.base)|=15, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] RET #84#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=17, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=3, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=15, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=1, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=31, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=5, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume !!#t~short1;havoc #t~short1;havoc #t~mem0;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset;havoc #t~mem2.base, #t~mem2.offset; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~short1|=true, ~head~0.base=17, ~head~0.offset=0] [?] assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#t~mem0|=2, |search_list_#t~short1|=false, ~head~0.base=17, ~head~0.offset=0] [?] assume !#t~short1;havoc #t~short1;havoc #t~mem0; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] #res.base, #res.offset := ~l.base, ~l.offset; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#res.base|=30, |search_list_#res.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume true; VAL [search_list_~k=2, search_list_~l.base=30, search_list_~l.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, |search_list_#in~k|=2, |search_list_#in~l.base|=17, |search_list_#in~l.offset|=0, |search_list_#res.base|=30, |search_list_#res.offset|=0, ~head~0.base=17, ~head~0.offset=0] [?] RET #86#return; VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8.base|=30, |main_#t~ret8.offset|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [main_~mylist~0.base=16, main_~mylist~0.offset=32, main_~temp~0.base=30, main_~temp~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem9|=2, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~head~0.base)|=0, |old(~head~0.offset)|=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=24, #NULL.offset=20, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L623] ~head~0.base, ~head~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0.base, ~mylist~0.offset; [L645] havoc ~temp~0.base, ~temp~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L634-L639] assume ~head~0.base == 0 && ~head~0.offset == 0; [L635] call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L624-L630] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L624-L630] ~k := #in~k; [L625] ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=3, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=5, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=2, #t~short1=false, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626-L628] assume !#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L629] #res.base, #res.offset := ~l.base, ~l.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L624-L630] ensures true; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L650] RET call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=30, #t~ret8.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset; [L650] havoc #t~ret8.base, #t~ret8.offset; [L651] call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=2, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32, ~temp~0.base=30, ~temp~0.offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=24, #NULL.offset=20, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=36, ~head~0.offset=23] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L623] ~head~0.base, ~head~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=24, old(#NULL.offset)=20, old(~head~0.base)=36, old(~head~0.offset)=23, ~head~0.base=0, ~head~0.offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0.base, ~mylist~0.offset; [L645] havoc ~temp~0.base, ~temp~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L634-L639] assume ~head~0.base == 0 && ~head~0.offset == 0; [L635] call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=0, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=2, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=30, #t~malloc3.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=30, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=5, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=31, #t~malloc3.offset=0, old(~head~0.base)=30, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=5, ~l.base=31, ~l.offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=31, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=1, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=15, #t~malloc3.offset=0, old(~head~0.base)=31, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=1, ~l.base=15, ~l.offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0] [L631-L642] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L631-L642] ~k := #in~k; [L632] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L632] ~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset; [L633] call write~int(~k, ~l.base, ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L634-L639] assume !(~head~0.base == 0 && ~head~0.offset == 0); [L637] call write~int(~k, ~l.base, ~l.offset, 4); [L638] call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=15, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L640] ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; [L641] #res := 0; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L631-L642] ensures true; VAL [#in~k=3, #in~l.base=16, #in~l.offset=32, #NULL.base=0, #NULL.offset=0, #res=0, #t~malloc3.base=17, #t~malloc3.offset=0, old(~head~0.base)=15, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=3, ~l.base=17, ~l.offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] CALL call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L624-L630] ~l.base, ~l.offset := #in~l.base, #in~l.offset; [L624-L630] ~k := #in~k; [L625] ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=3, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=17, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=15, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=5, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=31, ~l.offset=0] [L626-L628] assume !!#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4); [L627] ~l.base, ~l.offset := #t~mem2.base, #t~mem2.offset; [L627] havoc #t~mem2.base, #t~mem2.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] #t~short1 := ~l.base != 0 || ~l.offset != 0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~short1=true, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626] assume #t~short1; [L626] call #t~mem0 := read~int(~l.base, ~l.offset, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=2, #t~short1=false, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L626-L628] assume !#t~short1; [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L629] #res.base, #res.offset := ~l.base, ~l.offset; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L624-L630] ensures true; VAL [#in~k=2, #in~l.base=17, #in~l.offset=0, #NULL.base=0, #NULL.offset=0, #res.base=30, #res.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~k=2, ~l.base=30, ~l.offset=0] [L650] RET call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8.base=30, #t~ret8.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32] [L650] ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset; [L650] havoc #t~ret8.base, #t~ret8.offset; [L651] call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem9=2, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0, ~mylist~0.base=16, ~mylist~0.offset=32, ~temp~0.base=30, ~temp~0.offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~head~0.base=17, ~head~0.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~head~0.base)=0, old(~head~0.offset)=0, ~cond=0, ~head~0.base=17, ~head~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=24, #NULL!offset=20, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=36, ~head~0!offset=23] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L623] ~head~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=24, old(#NULL!offset)=20, old(~head~0!base)=36, old(~head~0!offset)=23, ~head~0!base=0, ~head~0!offset=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L644] havoc ~i~0; [L645] havoc ~mylist~0; [L645] havoc ~temp~0; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L646] CALL call #t~ret4 := insert_list(~mylist~0, 2); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L634] COND TRUE ~head~0 == { base: 0, offset: 0 } [L635] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=0, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=2, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=30, #t~malloc3!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L646] RET call #t~ret4 := insert_list(~mylist~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L646] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; [L646] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] CALL call #t~ret5 := insert_list(~mylist~0, 5); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=30, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=5, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=31, #t~malloc3!offset=0, old(~head~0!base)=30, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=5, ~l!base=31, ~l!offset=0] [L647] RET call #t~ret5 := insert_list(~mylist~0, 5); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L647] assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; [L647] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] CALL call #t~ret6 := insert_list(~mylist~0, 1); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=31, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=1, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=15, #t~malloc3!offset=0, old(~head~0!base)=31, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=1, ~l!base=15, ~l!offset=0] [L648] RET call #t~ret6 := insert_list(~mylist~0, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L648] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; [L648] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] CALL call #t~ret7 := insert_list(~mylist~0, 3); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0] [L631-L642] ~l := #in~l; [L631-L642] ~k := #in~k; [L632] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L632] ~l := #t~malloc3; [L633] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L634] COND FALSE !(~head~0 == { base: 0, offset: 0 }) [L637] FCALL call write~int(~k, { base: ~l!base, offset: ~l!offset }, 4); [L638] FCALL call write~$Pointer$(~head~0, { base: ~l!base, offset: 4 + ~l!offset }, 4); VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=15, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L640] ~head~0 := ~l; [L641] #res := 0; VAL [#in~k=3, #in~l!base=16, #in~l!offset=32, #NULL!base=0, #NULL!offset=0, #res=0, #t~malloc3!base=17, #t~malloc3!offset=0, old(~head~0!base)=15, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=3, ~l!base=17, ~l!offset=0] [L649] RET call #t~ret7 := insert_list(~mylist~0, 3); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L649] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L649] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] CALL call #t~ret8 := search_list(~head~0, 2); VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L624-L630] ~l := #in~l; [L624-L630] ~k := #in~k; [L625] ~l := ~head~0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=3, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=17, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=15, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=5, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=31, ~l!offset=0] [L626-L628] COND FALSE !(!#t~short1) [L626] havoc #t~short1; [L626] havoc #t~mem0; [L627] FCALL call #t~mem2 := read~$Pointer$({ base: ~l!base, offset: 4 + ~l!offset }, 4); [L627] ~l := #t~mem2; [L627] havoc #t~mem2; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] #t~short1 := ~l != { base: 0, offset: 0 }; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~short1=true, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626] COND TRUE #t~short1 [L626] FCALL call #t~mem0 := read~int({ base: ~l!base, offset: ~l!offset }, 4); [L626] #t~short1 := #t~mem0 != ~k; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=2, #t~short1=false, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L626-L628] COND TRUE !#t~short1 [L626] havoc #t~short1; [L626] havoc #t~mem0; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L629] #res := ~l; VAL [#in~k=2, #in~l!base=17, #in~l!offset=0, #NULL!base=0, #NULL!offset=0, #res!base=30, #res!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~k=2, ~l!base=30, ~l!offset=0] [L650] RET call #t~ret8 := search_list(~head~0, 2); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8!base=30, #t~ret8!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32] [L650] ~temp~0 := #t~ret8; [L650] havoc #t~ret8; [L651] FCALL call #t~mem9 := read~int({ base: ~temp~0!base, offset: ~temp~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem9=2, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0, ~mylist~0!base=16, ~mylist~0!offset=32, ~temp~0!base=30, ~temp~0!offset=0] [L651] CALL call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~head~0!base=17, ~head~0!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~head~0!base)=0, old(~head~0!offset)=0, ~cond=0, ~head~0!base=17, ~head~0!offset=0] [L623] mlist *head; VAL [\old(head)=36, \old(head)=23, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={16:32}, l={30:0}, malloc(sizeof(mlist))={30:0}] [L634] COND TRUE head==((void *)0) [L635] l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={30:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L646] RET insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={30:0}, insert_list(mylist,2)=0, mylist={16:32}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=30, \old(head)=0, \old(k)=5, head={30:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=30, \old(head)=0, \old(k)=5, head={30:0}, k=5, l={16:32}, l={31:0}, malloc(sizeof(mlist))={31:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=30, \old(head)=0, \old(k)=5, head={30:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=30, \old(k)=5, \result=0, head={31:0}, k=5, l={16:32}, l={31:0}, malloc(sizeof(mlist))={31:0}] [L647] RET insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={31:0}, insert_list(mylist,5)=0, mylist={16:32}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=31, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=0, \old(head)=31, \old(k)=1, head={31:0}, k=1, l={15:0}, l={16:32}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=31, \old(k)=1, \result=0, head={15:0}, k=1, l={15:0}, l={16:32}, malloc(sizeof(mlist))={15:0}] [L648] RET insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,1)=0, mylist={16:32}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=15, \old(k)=3, head={15:0}, k=3, l={16:32}, l={17:0}, malloc(sizeof(mlist))={17:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=0, \old(head)=15, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=15, \old(k)=3, \result=0, head={17:0}, k=3, l={16:32}, l={17:0}, malloc(sizeof(mlist))={17:0}] [L649] RET insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={17:0}, insert_list(mylist,3)=0, mylist={16:32}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, l={17:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={15:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={31:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={30:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={30:0}, head={17:0}, k=2, l={30:0}, l={17:0}] [L650] RET, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, search_list(head,2)={30:0}] [L650] temp = search_list(head,2) [L651] EXPR temp->key VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, temp={30:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={17:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] ----- [2018-11-23 14:38:20,207 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8c358d6c-64fd-4926-8ff8-19392373a04f/bin-2019/uautomizer/witness.graphml [2018-11-23 14:38:20,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:38:20,208 INFO L168 Benchmark]: Toolchain (without parser) took 83029.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 956.9 MB in the beginning and 1.2 GB in the end (delta: -242.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:38:20,209 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:38:20,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.9 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,209 INFO L168 Benchmark]: Boogie Preprocessor took 29.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,209 INFO L168 Benchmark]: RCFGBuilder took 518.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,210 INFO L168 Benchmark]: TraceAbstraction took 81450.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.7 MB). Peak memory consumption was 340.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,210 INFO L168 Benchmark]: Witness Printer took 396.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:38:20,212 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.17 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 599.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 956.9 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 518.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81450.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.7 MB). Peak memory consumption was 340.7 MB. Max. memory is 11.5 GB. * Witness Printer took 396.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] mlist *head; VAL [\old(head)=23, \old(head)=36, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L634] COND TRUE head==((void *)0) [L635] l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={30:0}, k=2, l={16:32}, l={30:0}, malloc(sizeof(mlist))={30:0}] [L646] RET insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={30:0}, insert_list(mylist,2)=0, mylist={16:32}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, k=5, l={16:32}, l={31:0}, malloc(sizeof(mlist))={31:0}] [L640] head = l [L641] return 0; VAL [\old(head)=30, \old(head)=0, \old(k)=5, \result=0, head={31:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L647] RET insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={31:0}, insert_list(mylist,5)=0, mylist={16:32}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=31, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=31, \old(k)=1, \result=0, head={15:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L648] RET insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,1)=0, mylist={16:32}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=0, \old(head)=15, \old(k)=3, head={15:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=15, \old(k)=3, \result=0, head={17:0}, k=3, l={16:32}, l={17:0}, malloc(sizeof(mlist))={17:0}] [L649] RET insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={17:0}, insert_list(mylist,3)=0, mylist={16:32}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, l={17:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={15:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={31:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={30:0}, l={17:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={30:0}, head={17:0}, k=2, l={30:0}, l={17:0}] [L650] RET, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, search_list(head,2)={30:0}] [L650] temp = search_list(head,2) [L651] EXPR temp->key VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, temp={30:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={17:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. UNSAFE Result, 81.3s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 53.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 414 SDslu, 976 SDs, 0 SdLazy, 2599 SolverSat, 268 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 181 SyntacticMatches, 14 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 67.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 486 ConstructedInterpolants, 12 QuantifiedInterpolants, 450811 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 220/342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...