./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:48:51,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:48:51,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:48:51,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:48:51,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:48:51,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:48:51,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:48:51,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:48:51,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:48:51,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:48:51,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:48:51,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:48:51,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:48:51,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:48:51,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:48:51,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:48:51,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:48:51,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:48:51,613 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:48:51,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:48:51,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:48:51,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:48:51,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:48:51,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:48:51,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:48:51,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:48:51,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:48:51,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:48:51,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:48:51,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:48:51,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:48:51,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:48:51,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:48:51,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:48:51,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:48:51,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:48:51,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:48:51,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:48:51,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:48:51,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:48:51,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:48:51,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:48:51,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:48:51,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:48:51,659 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:48:51,659 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:48:51,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:48:51,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:48:51,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:48:51,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:48:51,661 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:48:51,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:48:51,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:48:51,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:48:51,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:48:51,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:48:51,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:48:51,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:48:51,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:48:51,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:48:51,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:51,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:48:51,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:48:51,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:48:51,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2022-02-20 16:48:51,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:48:51,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:48:51,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:48:51,872 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:48:51,872 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:48:51,873 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2022-02-20 16:48:51,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f2b0589/2ba4e9f90040466d8d4f78ec5a6ee18a/FLAG3272382f4 [2022-02-20 16:48:52,289 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:48:52,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2022-02-20 16:48:52,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f2b0589/2ba4e9f90040466d8d4f78ec5a6ee18a/FLAG3272382f4 [2022-02-20 16:48:52,679 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f2b0589/2ba4e9f90040466d8d4f78ec5a6ee18a [2022-02-20 16:48:52,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:48:52,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:48:52,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:52,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:48:52,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:48:52,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:52" (1/1) ... [2022-02-20 16:48:52,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4554af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:52, skipping insertion in model container [2022-02-20 16:48:52,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:52" (1/1) ... [2022-02-20 16:48:52,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:48:52,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:48:52,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2022-02-20 16:48:53,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:53,023 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:48:53,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2022-02-20 16:48:53,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:53,089 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:48:53,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53 WrapperNode [2022-02-20 16:48:53,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:53,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:53,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:48:53,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:48:53,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,136 INFO L137 Inliner]: procedures = 226, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 101 [2022-02-20 16:48:53,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:53,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:48:53,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:48:53,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:48:53,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:48:53,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:48:53,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:48:53,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:48:53,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (1/1) ... [2022-02-20 16:48:53,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:53,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:48:53,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:48:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:48:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:48:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:48:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:48:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:48:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:48:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:48:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-02-20 16:48:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-02-20 16:48:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:48:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:48:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:48:53,354 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:48:53,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:48:53,518 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:48:53,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:48:53,523 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:48:53,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:53 BoogieIcfgContainer [2022-02-20 16:48:53,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:48:53,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:48:53,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:48:53,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:48:53,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:48:52" (1/3) ... [2022-02-20 16:48:53,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf83993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:53, skipping insertion in model container [2022-02-20 16:48:53,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:53" (2/3) ... [2022-02-20 16:48:53,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf83993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:53, skipping insertion in model container [2022-02-20 16:48:53,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:53" (3/3) ... [2022-02-20 16:48:53,530 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2022-02-20 16:48:53,533 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:48:53,534 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:48:53,563 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:48:53,568 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:48:53,568 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:48:53,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:48:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:48:53,585 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:53,585 INFO L514 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] [2022-02-20 16:48:53,586 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1135484681, now seen corresponding path program 1 times [2022-02-20 16:48:53,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:53,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097907213] [2022-02-20 16:48:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:53,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:53,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:53,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#(not (= ~head~0.base 0))} assume true; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,890 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {46#(not (= ~head~0.base 0))} {39#true} #105#return; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:53,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {64#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:53,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {65#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(= |old(~head~0.base)| 0)} assume true; {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,929 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65#(= |old(~head~0.base)| 0)} {46#(not (= ~head~0.base 0))} #107#return; {40#false} is VALID [2022-02-20 16:48:53,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:53,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:53,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:53,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:53,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:53,943 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39#true} {40#false} #109#return; {40#false} is VALID [2022-02-20 16:48:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:53,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:53,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:53,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:53,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:53,958 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39#true} {40#false} #111#return; {40#false} is VALID [2022-02-20 16:48:53,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2022-02-20 16:48:53,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:48:53,960 INFO L272 TraceCheckUtils]: 2: Hoare triple {39#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:53,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:53,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:53,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#(not (= ~head~0.base 0))} assume true; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,963 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {46#(not (= ~head~0.base 0))} {39#true} #105#return; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {46#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:53,965 INFO L272 TraceCheckUtils]: 9: Hoare triple {46#(not (= ~head~0.base 0))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:53,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {64#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:53,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {64#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= |old(~head~0.base)| 0)} assume true; {65#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:53,968 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {65#(= |old(~head~0.base)| 0)} {46#(not (= ~head~0.base 0))} #107#return; {40#false} is VALID [2022-02-20 16:48:53,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {40#false} is VALID [2022-02-20 16:48:53,969 INFO L272 TraceCheckUtils]: 16: Hoare triple {40#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:53,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:53,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:53,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:53,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:53,970 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {39#true} {40#false} #109#return; {40#false} is VALID [2022-02-20 16:48:53,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {40#false} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {40#false} is VALID [2022-02-20 16:48:53,970 INFO L272 TraceCheckUtils]: 23: Hoare triple {40#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:53,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {62#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:53,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:53,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:53,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:53,971 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {39#true} {40#false} #111#return; {40#false} is VALID [2022-02-20 16:48:53,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {40#false} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2022-02-20 16:48:53,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {40#false} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {40#false} is VALID [2022-02-20 16:48:53,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {40#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2022-02-20 16:48:53,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 16:48:53,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {40#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {40#false} is VALID [2022-02-20 16:48:53,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {40#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {40#false} is VALID [2022-02-20 16:48:53,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {40#false} assume 0 == __VERIFIER_assert_~cond#1; {40#false} is VALID [2022-02-20 16:48:53,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:48:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:48:53,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:53,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097907213] [2022-02-20 16:48:53,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097907213] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:48:53,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529179222] [2022-02-20 16:48:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:53,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:53,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:53,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:48:53,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:48:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:48:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:54,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {39#true} is VALID [2022-02-20 16:48:54,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:48:54,180 INFO L272 TraceCheckUtils]: 2: Hoare triple {39#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {39#true} is VALID [2022-02-20 16:48:54,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:54,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:54,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:54,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:54,181 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2022-02-20 16:48:54,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {39#true} is VALID [2022-02-20 16:48:54,181 INFO L272 TraceCheckUtils]: 9: Hoare triple {39#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {39#true} is VALID [2022-02-20 16:48:54,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:54,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:54,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:54,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:54,182 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {39#true} {39#true} #107#return; {39#true} is VALID [2022-02-20 16:48:54,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {39#true} is VALID [2022-02-20 16:48:54,183 INFO L272 TraceCheckUtils]: 16: Hoare triple {39#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {39#true} is VALID [2022-02-20 16:48:54,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:54,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:54,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:54,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:54,184 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {39#true} {39#true} #109#return; {39#true} is VALID [2022-02-20 16:48:54,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {39#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {39#true} is VALID [2022-02-20 16:48:54,184 INFO L272 TraceCheckUtils]: 23: Hoare triple {39#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {39#true} is VALID [2022-02-20 16:48:54,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:48:54,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {39#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {39#true} is VALID [2022-02-20 16:48:54,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {39#true} is VALID [2022-02-20 16:48:54,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:48:54,185 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {39#true} {39#true} #111#return; {39#true} is VALID [2022-02-20 16:48:54,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {39#true} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {39#true} is VALID [2022-02-20 16:48:54,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {39#true} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {39#true} is VALID [2022-02-20 16:48:54,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {39#true} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {39#true} is VALID [2022-02-20 16:48:54,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:48:54,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {40#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {40#false} is VALID [2022-02-20 16:48:54,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {40#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {40#false} is VALID [2022-02-20 16:48:54,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {40#false} assume 0 == __VERIFIER_assert_~cond#1; {40#false} is VALID [2022-02-20 16:48:54,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:48:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 16:48:54,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:54,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529179222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:54,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:48:54,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2022-02-20 16:48:54,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769048115] [2022-02-20 16:48:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 16:48:54,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:54,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:54,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:54,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:48:54,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:48:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:48:54,274 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:54,332 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2022-02-20 16:48:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:48:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 16:48:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2022-02-20 16:48:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2022-02-20 16:48:54,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2022-02-20 16:48:54,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:54,407 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:48:54,408 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:48:54,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:48:54,412 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:54,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:48:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:48:54,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:54,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:48:54,435 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:48:54,436 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:48:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:54,438 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:48:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:48:54,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:54,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:54,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-02-20 16:48:54,440 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-02-20 16:48:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:54,445 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:48:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:48:54,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:54,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:54,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:54,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:48:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:48:54,449 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 37 [2022-02-20 16:48:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:54,450 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:48:54,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:48:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:48:54,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:54,452 INFO L514 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] [2022-02-20 16:48:54,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:48:54,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 16:48:54,668 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1275349378, now seen corresponding path program 1 times [2022-02-20 16:48:54,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:54,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381141471] [2022-02-20 16:48:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:54,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:54,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {342#(not (= ~head~0.base 0))} assume true; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,810 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {342#(not (= ~head~0.base 0))} {335#true} #105#return; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {360#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:54,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#(= |old(~head~0.base)| 0)} assume true; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,848 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {361#(= |old(~head~0.base)| 0)} {342#(not (= ~head~0.base 0))} #107#return; {336#false} is VALID [2022-02-20 16:48:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:54,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:54,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:54,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:54,858 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {335#true} {336#false} #109#return; {336#false} is VALID [2022-02-20 16:48:54,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:54,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:54,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:54,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:54,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:54,867 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {335#true} {336#false} #111#return; {336#false} is VALID [2022-02-20 16:48:54,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {335#true} is VALID [2022-02-20 16:48:54,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {335#true} is VALID [2022-02-20 16:48:54,869 INFO L272 TraceCheckUtils]: 2: Hoare triple {335#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:54,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:54,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:54,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(not (= ~head~0.base 0))} assume true; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,872 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {342#(not (= ~head~0.base 0))} {335#true} #105#return; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:54,873 INFO L272 TraceCheckUtils]: 9: Hoare triple {342#(not (= ~head~0.base 0))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:54,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {360#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:54,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {360#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#(= |old(~head~0.base)| 0)} assume true; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:54,876 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {361#(= |old(~head~0.base)| 0)} {342#(not (= ~head~0.base 0))} #107#return; {336#false} is VALID [2022-02-20 16:48:54,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {336#false} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {336#false} is VALID [2022-02-20 16:48:54,877 INFO L272 TraceCheckUtils]: 16: Hoare triple {336#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:54,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:54,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:54,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:54,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:54,877 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {335#true} {336#false} #109#return; {336#false} is VALID [2022-02-20 16:48:54,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {336#false} is VALID [2022-02-20 16:48:54,878 INFO L272 TraceCheckUtils]: 23: Hoare triple {336#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:54,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {358#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:54,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:54,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:54,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:54,879 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {335#true} {336#false} #111#return; {336#false} is VALID [2022-02-20 16:48:54,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {336#false} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:54,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {336#false} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {336#false} is VALID [2022-02-20 16:48:54,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {336#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:54,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {336#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {336#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {336#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {336#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {336#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {336#false} assume 0 == __VERIFIER_assert_~cond#1; {336#false} is VALID [2022-02-20 16:48:54,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:48:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:48:54,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:54,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381141471] [2022-02-20 16:48:54,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381141471] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:48:54,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679179371] [2022-02-20 16:48:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:54,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:54,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:48:54,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:48:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:55,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:48:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:55,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:55,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {335#true} is VALID [2022-02-20 16:48:55,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {335#true} is VALID [2022-02-20 16:48:55,180 INFO L272 TraceCheckUtils]: 2: Hoare triple {335#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {335#true} is VALID [2022-02-20 16:48:55,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:55,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:55,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(not (= ~head~0.base 0))} assume true; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,183 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {342#(not (= ~head~0.base 0))} {335#true} #105#return; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,184 INFO L272 TraceCheckUtils]: 9: Hoare triple {342#(not (= ~head~0.base 0))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {360#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:55,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {360#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {360#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:55,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {360#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#(= |old(~head~0.base)| 0)} assume true; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,187 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {361#(= |old(~head~0.base)| 0)} {342#(not (= ~head~0.base 0))} #107#return; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {336#false} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L272 TraceCheckUtils]: 16: Hoare triple {336#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {336#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {336#false} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {336#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {336#false} assume true; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {336#false} {336#false} #109#return; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {336#false} is VALID [2022-02-20 16:48:55,187 INFO L272 TraceCheckUtils]: 23: Hoare triple {336#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {336#false} is VALID [2022-02-20 16:48:55,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {336#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {336#false} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {336#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {336#false} assume true; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {336#false} {336#false} #111#return; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {336#false} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {336#false} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {336#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {336#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {336#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {336#false} is VALID [2022-02-20 16:48:55,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {336#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {336#false} is VALID [2022-02-20 16:48:55,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {336#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {336#false} is VALID [2022-02-20 16:48:55,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {336#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {336#false} is VALID [2022-02-20 16:48:55,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {336#false} assume 0 == __VERIFIER_assert_~cond#1; {336#false} is VALID [2022-02-20 16:48:55,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:48:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:48:55,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:48:55,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {336#false} assume 0 == __VERIFIER_assert_~cond#1; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {336#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {336#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {336#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {336#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {336#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {336#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {336#false} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {336#false} is VALID [2022-02-20 16:48:55,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {336#false} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {336#false} is VALID [2022-02-20 16:48:55,440 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {335#true} {336#false} #111#return; {336#false} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {335#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:55,441 INFO L272 TraceCheckUtils]: 23: Hoare triple {336#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {336#false} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {336#false} is VALID [2022-02-20 16:48:55,441 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {335#true} {336#false} #109#return; {336#false} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {335#true} assume true; {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {335#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {335#true} is VALID [2022-02-20 16:48:55,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {335#true} is VALID [2022-02-20 16:48:55,442 INFO L272 TraceCheckUtils]: 16: Hoare triple {336#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {335#true} is VALID [2022-02-20 16:48:55,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {336#false} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {336#false} is VALID [2022-02-20 16:48:55,443 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {361#(= |old(~head~0.base)| 0)} {342#(not (= ~head~0.base 0))} #107#return; {336#false} is VALID [2022-02-20 16:48:55,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#(= |old(~head~0.base)| 0)} assume true; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#(= |old(~head~0.base)| 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {563#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {361#(= |old(~head~0.base)| 0)} is VALID [2022-02-20 16:48:55,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {563#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {563#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} is VALID [2022-02-20 16:48:55,450 INFO L272 TraceCheckUtils]: 9: Hoare triple {342#(not (= ~head~0.base 0))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {563#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} is VALID [2022-02-20 16:48:55,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,451 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {342#(not (= ~head~0.base 0))} {335#true} #105#return; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(not (= ~head~0.base 0))} assume true; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {342#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:55,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:55,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {335#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {359#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:55,455 INFO L272 TraceCheckUtils]: 2: Hoare triple {335#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {335#true} is VALID [2022-02-20 16:48:55,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {335#true} is VALID [2022-02-20 16:48:55,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {335#true} is VALID [2022-02-20 16:48:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:48:55,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679179371] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:48:55,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:48:55,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-02-20 16:48:55,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994043967] [2022-02-20 16:48:55,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:48:55,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 16:48:55,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:55,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:48:55,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:55,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:48:55,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:48:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:48:55,500 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:48:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:55,750 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-02-20 16:48:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:48:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 16:48:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:48:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-02-20 16:48:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:48:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-02-20 16:48:55,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-02-20 16:48:55,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:55,828 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:48:55,828 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:48:55,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:48:55,829 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:55,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 88 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:48:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 16:48:55,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:55,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:55,833 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:55,833 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:55,834 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:48:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:48:55,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:55,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:55,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 31 states. [2022-02-20 16:48:55,837 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 31 states. [2022-02-20 16:48:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:55,843 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:48:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:48:55,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:55,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:55,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:55,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:48:55,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 39 [2022-02-20 16:48:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:55,847 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:48:55,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:48:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:48:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:48:55,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:55,853 INFO L514 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] [2022-02-20 16:48:55,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:56,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 16:48:56,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 177460864, now seen corresponding path program 1 times [2022-02-20 16:48:56,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:56,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662687529] [2022-02-20 16:48:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {774#true} is VALID [2022-02-20 16:48:56,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,163 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {774#true} {774#true} #105#return; {774#true} is VALID [2022-02-20 16:48:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} 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); {774#true} is VALID [2022-02-20 16:48:56,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,171 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {774#true} {774#true} #107#return; {774#true} is VALID [2022-02-20 16:48:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} 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); {774#true} is VALID [2022-02-20 16:48:56,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,182 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {774#true} {774#true} #109#return; {774#true} is VALID [2022-02-20 16:48:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:56,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 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); {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:56,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {796#(not (= ~head~0.base 0))} assume true; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,234 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {796#(not (= ~head~0.base 0))} {774#true} #111#return; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {774#true} is VALID [2022-02-20 16:48:56,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {774#true} is VALID [2022-02-20 16:48:56,237 INFO L272 TraceCheckUtils]: 2: Hoare triple {774#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {774#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {774#true} is VALID [2022-02-20 16:48:56,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,238 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {774#true} {774#true} #105#return; {774#true} is VALID [2022-02-20 16:48:56,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {774#true} is VALID [2022-02-20 16:48:56,240 INFO L272 TraceCheckUtils]: 9: Hoare triple {774#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} 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); {774#true} is VALID [2022-02-20 16:48:56,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,241 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {774#true} {774#true} #107#return; {774#true} is VALID [2022-02-20 16:48:56,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {774#true} is VALID [2022-02-20 16:48:56,242 INFO L272 TraceCheckUtils]: 16: Hoare triple {774#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {774#true} is VALID [2022-02-20 16:48:56,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} 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); {774#true} is VALID [2022-02-20 16:48:56,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {774#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {774#true} is VALID [2022-02-20 16:48:56,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {774#true} assume true; {774#true} is VALID [2022-02-20 16:48:56,243 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {774#true} {774#true} #109#return; {774#true} is VALID [2022-02-20 16:48:56,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {774#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {774#true} is VALID [2022-02-20 16:48:56,244 INFO L272 TraceCheckUtils]: 23: Hoare triple {774#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {798#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:56,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 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); {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} is VALID [2022-02-20 16:48:56,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {799#(or (<= (+ 1 insert_list_~l.base) 0) (not (<= insert_list_~l.base 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {796#(not (= ~head~0.base 0))} assume true; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,247 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {796#(not (= ~head~0.base 0))} {774#true} #111#return; {796#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:56,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {797#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {797#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {775#false} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {775#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {775#false} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {775#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {775#false} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {775#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {775#false} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {775#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {775#false} is VALID [2022-02-20 16:48:56,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {775#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {775#false} is VALID [2022-02-20 16:48:56,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {775#false} is VALID [2022-02-20 16:48:56,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == __VERIFIER_assert_~cond#1; {775#false} is VALID [2022-02-20 16:48:56,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-02-20 16:48:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 16:48:56,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:56,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662687529] [2022-02-20 16:48:56,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662687529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:56,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:56,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:48:56,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917502476] [2022-02-20 16:48:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:56,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-02-20 16:48:56,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:56,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:56,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:48:56,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:48:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:56,275 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,470 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 16:48:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:48:56,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-02-20 16:48:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-02-20 16:48:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-02-20 16:48:56,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-02-20 16:48:56,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:56,520 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:48:56,521 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:48:56,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:48:56,522 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:56,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 83 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:48:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 16:48:56,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:56,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,540 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,540 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,541 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:48:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:48:56,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:56,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:56,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:48:56,543 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:48:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,544 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:48:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:48:56,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:56,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:56,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:56,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 16:48:56,546 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 39 [2022-02-20 16:48:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:56,546 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 16:48:56,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:48:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:48:56,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:56,546 INFO L514 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] [2022-02-20 16:48:56,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:48:56,547 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 104078038, now seen corresponding path program 1 times [2022-02-20 16:48:56,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:56,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835580193] [2022-02-20 16:48:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {966#true} is VALID [2022-02-20 16:48:56,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,626 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {966#true} {966#true} #105#return; {966#true} is VALID [2022-02-20 16:48:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,634 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {966#true} {966#true} #107#return; {966#true} is VALID [2022-02-20 16:48:56,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,649 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {966#true} {966#true} #109#return; {966#true} is VALID [2022-02-20 16:48:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:56,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,664 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {966#true} {966#true} #111#return; {966#true} is VALID [2022-02-20 16:48:56,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {966#true} is VALID [2022-02-20 16:48:56,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {966#true} is VALID [2022-02-20 16:48:56,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {966#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {966#true} is VALID [2022-02-20 16:48:56,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,667 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {966#true} {966#true} #105#return; {966#true} is VALID [2022-02-20 16:48:56,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {966#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {966#true} is VALID [2022-02-20 16:48:56,668 INFO L272 TraceCheckUtils]: 9: Hoare triple {966#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,670 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {966#true} {966#true} #107#return; {966#true} is VALID [2022-02-20 16:48:56,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {966#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {966#true} is VALID [2022-02-20 16:48:56,671 INFO L272 TraceCheckUtils]: 16: Hoare triple {966#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,674 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {966#true} {966#true} #109#return; {966#true} is VALID [2022-02-20 16:48:56,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {966#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {966#true} is VALID [2022-02-20 16:48:56,676 INFO L272 TraceCheckUtils]: 23: Hoare triple {966#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:56,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {993#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {966#true} is VALID [2022-02-20 16:48:56,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {966#true} 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); {966#true} is VALID [2022-02-20 16:48:56,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {966#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {966#true} is VALID [2022-02-20 16:48:56,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {966#true} assume true; {966#true} is VALID [2022-02-20 16:48:56,677 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {966#true} {966#true} #111#return; {966#true} is VALID [2022-02-20 16:48:56,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {966#true} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {966#true} is VALID [2022-02-20 16:48:56,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {966#true} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {966#true} is VALID [2022-02-20 16:48:56,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {966#true} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {966#true} is VALID [2022-02-20 16:48:56,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {966#true} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {988#(= |ULTIMATE.start_search_list_~k#1| 2)} is VALID [2022-02-20 16:48:56,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {988#(= |ULTIMATE.start_search_list_~k#1| 2)} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {988#(= |ULTIMATE.start_search_list_~k#1| 2)} is VALID [2022-02-20 16:48:56,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {988#(= |ULTIMATE.start_search_list_~k#1| 2)} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {989#(or |ULTIMATE.start_search_list_#t~short32#1| (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|) 2))} is VALID [2022-02-20 16:48:56,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {989#(or |ULTIMATE.start_search_list_#t~short32#1| (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|) 2))} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {990#(= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|) 2)} is VALID [2022-02-20 16:48:56,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {990#(= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|) 2)} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {991#(= 2 (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) |ULTIMATE.start_search_list_#res#1.offset|))} is VALID [2022-02-20 16:48:56,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {991#(= 2 (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) |ULTIMATE.start_search_list_#res#1.offset|))} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {992#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:48:56,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {992#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {967#false} is VALID [2022-02-20 16:48:56,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 16:48:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 16:48:56,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:56,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835580193] [2022-02-20 16:48:56,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835580193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:56,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:56,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:48:56,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312842577] [2022-02-20 16:48:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 16:48:56,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:56,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:56,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:48:56,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:48:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:48:56,706 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,888 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:48:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:48:56,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 16:48:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 16:48:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-02-20 16:48:56,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-02-20 16:48:56,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:56,929 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:48:56,929 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:48:56,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:48:56,930 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:56,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:48:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 16:48:56,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:56,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,933 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,933 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,935 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:48:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:48:56,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:56,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:56,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:48:56,936 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:48:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:56,937 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:48:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:48:56,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:56,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:56,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:56,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 16:48:56,952 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 40 [2022-02-20 16:48:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:56,953 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 16:48:56,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:48:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:48:56,955 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:56,956 INFO L514 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] [2022-02-20 16:48:56,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:48:56,956 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 161336340, now seen corresponding path program 1 times [2022-02-20 16:48:56,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:56,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112117842] [2022-02-20 16:48:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1158#true} is VALID [2022-02-20 16:48:57,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,067 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1158#true} {1158#true} #105#return; {1158#true} is VALID [2022-02-20 16:48:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,075 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1158#true} {1158#true} #107#return; {1158#true} is VALID [2022-02-20 16:48:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,081 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1158#true} {1158#true} #109#return; {1158#true} is VALID [2022-02-20 16:48:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1186#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#(= insert_list_~l.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); {1186#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {1180#(= ~head~0.offset 0)} assume true; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,104 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1180#(= ~head~0.offset 0)} {1158#true} #111#return; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {1158#true} is VALID [2022-02-20 16:48:57,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1158#true} is VALID [2022-02-20 16:48:57,105 INFO L272 TraceCheckUtils]: 2: Hoare triple {1158#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {1158#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1158#true} is VALID [2022-02-20 16:48:57,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,106 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1158#true} {1158#true} #105#return; {1158#true} is VALID [2022-02-20 16:48:57,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {1158#true} is VALID [2022-02-20 16:48:57,108 INFO L272 TraceCheckUtils]: 9: Hoare triple {1158#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,109 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1158#true} {1158#true} #107#return; {1158#true} is VALID [2022-02-20 16:48:57,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L272 TraceCheckUtils]: 16: Hoare triple {1158#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1158#true} {1158#true} #109#return; {1158#true} is VALID [2022-02-20 16:48:57,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {1158#true} is VALID [2022-02-20 16:48:57,115 INFO L272 TraceCheckUtils]: 23: Hoare triple {1158#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {1185#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1186#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {1186#(= insert_list_~l.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); {1186#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {1186#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {1180#(= ~head~0.offset 0)} assume true; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,117 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1180#(= ~head~0.offset 0)} {1158#true} #111#return; {1180#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {1180#(= ~head~0.offset 0)} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1181#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| 0) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base))} is VALID [2022-02-20 16:48:57,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {1181#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| 0) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {1182#(not (= ~head~0.base 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {1182#(not (= ~head~0.base 0))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1183#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} is VALID [2022-02-20 16:48:57,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {1183#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1184#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:48:57,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {1184#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {1159#false} is VALID [2022-02-20 16:48:57,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {1159#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1159#false} is VALID [2022-02-20 16:48:57,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {1159#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1159#false} is VALID [2022-02-20 16:48:57,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {1159#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1159#false} is VALID [2022-02-20 16:48:57,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {1159#false} assume 0 == __VERIFIER_assert_~cond#1; {1159#false} is VALID [2022-02-20 16:48:57,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {1159#false} assume !false; {1159#false} is VALID [2022-02-20 16:48:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 16:48:57,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:57,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112117842] [2022-02-20 16:48:57,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112117842] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:48:57,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381600241] [2022-02-20 16:48:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:57,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:48:57,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 16:48:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:48:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:57,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {1158#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1158#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L272 TraceCheckUtils]: 2: Hoare triple {1158#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {1158#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {1158#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1158#true} {1158#true} #105#return; {1158#true} is VALID [2022-02-20 16:48:57,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {1158#true} is VALID [2022-02-20 16:48:57,359 INFO L272 TraceCheckUtils]: 9: Hoare triple {1158#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {1158#true} is VALID [2022-02-20 16:48:57,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {1158#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1158#true} {1158#true} #107#return; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L272 TraceCheckUtils]: 16: Hoare triple {1158#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {1158#true} 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); {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {1158#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {1158#true} assume true; {1158#true} is VALID [2022-02-20 16:48:57,360 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1158#true} {1158#true} #109#return; {1158#true} is VALID [2022-02-20 16:48:57,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {1158#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {1158#true} is VALID [2022-02-20 16:48:57,361 INFO L272 TraceCheckUtils]: 23: Hoare triple {1158#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {1158#true} is VALID [2022-02-20 16:48:57,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {1158#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1262#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:57,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {1262#(not (= 0 insert_list_~l.base))} 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); {1262#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:57,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {1262#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {1182#(not (= ~head~0.base 0))} assume true; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,363 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1182#(not (= ~head~0.base 0))} {1158#true} #111#return; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {1182#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {1182#(not (= ~head~0.base 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {1182#(not (= ~head~0.base 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {1182#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:57,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {1182#(not (= ~head~0.base 0))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1183#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} is VALID [2022-02-20 16:48:57,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {1183#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1184#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {1184#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {1159#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {1159#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {1159#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {1159#false} assume 0 == __VERIFIER_assert_~cond#1; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {1159#false} assume !false; {1159#false} is VALID [2022-02-20 16:48:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 16:48:57,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:57,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381600241] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:57,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:48:57,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2022-02-20 16:48:57,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570335759] [2022-02-20 16:48:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 16:48:57,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:57,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:57,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:57,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:48:57,386 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:48:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:48:57,387 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:57,541 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 16:48:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:48:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 16:48:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:48:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:48:57,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-02-20 16:48:57,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:57,598 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:48:57,599 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:48:57,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:48:57,599 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:57,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:48:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-02-20 16:48:57,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:57,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:57,603 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:57,603 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:57,604 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-02-20 16:48:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 16:48:57,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:57,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:57,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 36 states. [2022-02-20 16:48:57,604 INFO L87 Difference]: Start difference. First operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 36 states. [2022-02-20 16:48:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:57,606 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-02-20 16:48:57,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 16:48:57,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:57,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:57,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:57,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-02-20 16:48:57,607 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 40 [2022-02-20 16:48:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:57,607 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-02-20 16:48:57,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:48:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-02-20 16:48:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 16:48:57,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:57,608 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-20 16:48:57,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:57,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:57,808 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1968420967, now seen corresponding path program 1 times [2022-02-20 16:48:57,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:57,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111149200] [2022-02-20 16:48:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:48:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:57,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1488#true} is VALID [2022-02-20 16:48:57,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:57,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:57,882 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1488#true} {1488#true} #105#return; {1488#true} is VALID [2022-02-20 16:48:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:48:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:57,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} 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); {1488#true} is VALID [2022-02-20 16:48:57,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:57,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:57,888 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1488#true} {1488#true} #107#return; {1488#true} is VALID [2022-02-20 16:48:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:48:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1515#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1515#(= insert_list_~l.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); {1515#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1515#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {1505#(= ~head~0.offset 0)} assume true; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,908 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1505#(= ~head~0.offset 0)} {1488#true} #109#return; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:48:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:57,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1516#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:48:57,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1516#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.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); {1517#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:48:57,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1517#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:48:57,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} assume true; {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:48:57,976 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} {1505#(= ~head~0.offset 0)} #111#return; {1511#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:48:57,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {1488#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {1488#true} is VALID [2022-02-20 16:48:57,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L272 TraceCheckUtils]: 2: Hoare triple {1488#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {1488#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1488#true} {1488#true} #105#return; {1488#true} is VALID [2022-02-20 16:48:57,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {1488#true} is VALID [2022-02-20 16:48:57,978 INFO L272 TraceCheckUtils]: 9: Hoare triple {1488#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:57,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#true} 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); {1488#true} is VALID [2022-02-20 16:48:57,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:57,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:57,978 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1488#true} {1488#true} #107#return; {1488#true} is VALID [2022-02-20 16:48:57,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {1488#true} is VALID [2022-02-20 16:48:57,979 INFO L272 TraceCheckUtils]: 16: Hoare triple {1488#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1515#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#(= insert_list_~l.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); {1515#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:48:57,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {1515#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#(= ~head~0.offset 0)} assume true; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,982 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1505#(= ~head~0.offset 0)} {1488#true} #109#return; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {1505#(= ~head~0.offset 0)} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {1505#(= ~head~0.offset 0)} is VALID [2022-02-20 16:48:57,983 INFO L272 TraceCheckUtils]: 23: Hoare triple {1505#(= ~head~0.offset 0)} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:48:57,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1516#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:48:57,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {1516#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.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); {1517#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:48:57,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {1517#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:48:57,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} assume true; {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:48:57,986 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1518#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} {1505#(= ~head~0.offset 0)} #111#return; {1511#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:48:57,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {1511#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1512#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {1512#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {1489#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {1489#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {1489#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {1489#false} assume !search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {1489#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {1489#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {1489#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1489#false} is VALID [2022-02-20 16:48:57,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {1489#false} assume 0 == __VERIFIER_assert_~cond#1; {1489#false} is VALID [2022-02-20 16:48:57,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-02-20 16:48:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 16:48:57,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111149200] [2022-02-20 16:48:57,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111149200] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:48:57,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754377552] [2022-02-20 16:48:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:57,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:48:57,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 16:48:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:58,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 16:48:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:58,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:58,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:48:58,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2022-02-20 16:48:58,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {1488#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {1488#true} is VALID [2022-02-20 16:48:58,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L272 TraceCheckUtils]: 2: Hoare triple {1488#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {1488#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1488#true} {1488#true} #105#return; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L272 TraceCheckUtils]: 9: Hoare triple {1488#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#true} 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); {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1488#true} {1488#true} #107#return; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {1488#true} is VALID [2022-02-20 16:48:58,331 INFO L272 TraceCheckUtils]: 16: Hoare triple {1488#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {1488#true} is VALID [2022-02-20 16:48:58,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1573#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:58,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1573#(not (= 0 insert_list_~l.base))} 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); {1573#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:58,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {1573#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#(not (= ~head~0.base 0))} assume true; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,333 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1580#(not (= ~head~0.base 0))} {1488#true} #109#return; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,334 INFO L272 TraceCheckUtils]: 23: Hoare triple {1580#(not (= ~head~0.base 0))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {1593#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:48:58,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {1593#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1597#(and (= |old(~head~0.base)| ~head~0.base) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:48:58,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {1597#(and (= |old(~head~0.base)| ~head~0.base) (= insert_list_~l.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); {1601#(and (= insert_list_~l.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} is VALID [2022-02-20 16:48:58,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {1601#(and (= insert_list_~l.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1605#(and (= ~head~0.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} is VALID [2022-02-20 16:48:58,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {1605#(and (= ~head~0.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} assume true; {1605#(and (= ~head~0.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} is VALID [2022-02-20 16:48:58,337 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1605#(and (= ~head~0.offset 0) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} {1580#(not (= ~head~0.base 0))} #111#return; {1511#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:48:58,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {1511#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1615#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0))} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {1615#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {1489#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {1489#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {1489#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {1489#false} assume !search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {1489#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {1489#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {1489#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1489#false} is VALID [2022-02-20 16:48:58,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {1489#false} assume 0 == __VERIFIER_assert_~cond#1; {1489#false} is VALID [2022-02-20 16:48:58,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-02-20 16:48:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:48:58,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {1489#false} assume 0 == __VERIFIER_assert_~cond#1; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {1489#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {1489#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {1489#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {1489#false} assume !search_list_#t~short32#1; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {1489#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {1489#false} is VALID [2022-02-20 16:48:58,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {1489#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1489#false} is VALID [2022-02-20 16:48:58,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {1489#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {1489#false} is VALID [2022-02-20 16:48:58,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {1489#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1489#false} is VALID [2022-02-20 16:48:58,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {1489#false} is VALID [2022-02-20 16:48:58,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {1512#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1513#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} is VALID [2022-02-20 16:48:58,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {1694#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1512#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} is VALID [2022-02-20 16:48:58,556 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} {1580#(not (= ~head~0.base 0))} #111#return; {1694#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0))} is VALID [2022-02-20 16:48:58,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume true; {1701#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:48:58,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {1708#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1701#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:48:58,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 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); {1708#(or (= |old(~head~0.base)| 0) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0)))} is VALID [2022-02-20 16:48:58,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {1712#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1712#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} is VALID [2022-02-20 16:48:58,558 INFO L272 TraceCheckUtils]: 23: Hoare triple {1580#(not (= ~head~0.base 0))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {1712#(or (= |old(~head~0.base)| 0) (not (= ~head~0.base 0)))} is VALID [2022-02-20 16:48:58,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {1580#(not (= ~head~0.base 0))} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,559 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1580#(not (= ~head~0.base 0))} {1488#true} #109#return; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#(not (= ~head~0.base 0))} assume true; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {1573#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1580#(not (= ~head~0.base 0))} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {1573#(not (= 0 insert_list_~l.base))} 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); {1573#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1573#(not (= 0 insert_list_~l.base))} is VALID [2022-02-20 16:48:58,560 INFO L272 TraceCheckUtils]: 16: Hoare triple {1488#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1488#true} {1488#true} #107#return; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#true} 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); {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L272 TraceCheckUtils]: 9: Hoare triple {1488#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {1488#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {1488#true} is VALID [2022-02-20 16:48:58,560 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1488#true} {1488#true} #105#return; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {1488#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1488#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L272 TraceCheckUtils]: 2: Hoare triple {1488#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {1488#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {1488#true} is VALID [2022-02-20 16:48:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:48:58,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754377552] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:48:58,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:48:58,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2022-02-20 16:48:58,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96850540] [2022-02-20 16:48:58,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:48:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-02-20 16:48:58,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:58,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 16:48:58,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:58,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 16:48:58,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:58,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 16:48:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-02-20 16:48:58,610 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 16:48:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:59,641 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-02-20 16:48:59,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 16:48:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-02-20 16:48:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 16:48:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-02-20 16:48:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 16:48:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-02-20 16:48:59,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-02-20 16:48:59,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:59,689 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:48:59,689 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:48:59,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 16:48:59,691 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:59,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 200 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 16:48:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:48:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-02-20 16:48:59,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:59,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:59,694 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:59,694 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:59,695 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 16:48:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 16:48:59,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:59,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:59,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 40 states. [2022-02-20 16:48:59,696 INFO L87 Difference]: Start difference. First operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 40 states. [2022-02-20 16:48:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:59,700 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 16:48:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 16:48:59,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:59,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:59,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:59,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:48:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-20 16:48:59,701 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 43 [2022-02-20 16:48:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:59,702 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-20 16:48:59,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 16:48:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 16:48:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 16:48:59,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:59,702 INFO L514 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] [2022-02-20 16:48:59,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:59,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:59,915 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2034659567, now seen corresponding path program 2 times [2022-02-20 16:48:59,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:59,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978896816] [2022-02-20 16:48:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2012#true} is VALID [2022-02-20 16:49:00,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,056 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2012#true} {2012#true} #105#return; {2012#true} is VALID [2022-02-20 16:49:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:49:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2012#true} {2012#true} #107#return; {2012#true} is VALID [2022-02-20 16:49:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:49:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2040#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:00,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {2040#(= insert_list_~l.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); {2040#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:00,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {2040#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {2029#(= ~head~0.offset 0)} assume true; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,085 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2029#(= ~head~0.offset 0)} {2012#true} #109#return; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:49:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2041#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:00,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2041#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.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); {2042#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:00,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {2042#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:49:00,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} assume true; {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:49:00,150 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} {2029#(= ~head~0.offset 0)} #111#return; {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {2012#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {2012#true} is VALID [2022-02-20 16:49:00,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2012#true} is VALID [2022-02-20 16:49:00,152 INFO L272 TraceCheckUtils]: 2: Hoare triple {2012#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:00,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {2012#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2012#true} is VALID [2022-02-20 16:49:00,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,153 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2012#true} {2012#true} #105#return; {2012#true} is VALID [2022-02-20 16:49:00,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L272 TraceCheckUtils]: 9: Hoare triple {2012#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:00,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2012#true} {2012#true} #107#return; {2012#true} is VALID [2022-02-20 16:49:00,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {2012#true} is VALID [2022-02-20 16:49:00,155 INFO L272 TraceCheckUtils]: 16: Hoare triple {2012#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:00,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2040#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:00,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {2040#(= insert_list_~l.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); {2040#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:00,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2040#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {2029#(= ~head~0.offset 0)} assume true; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,157 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2029#(= ~head~0.offset 0)} {2012#true} #109#return; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {2029#(= ~head~0.offset 0)} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {2029#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:00,158 INFO L272 TraceCheckUtils]: 23: Hoare triple {2029#(= ~head~0.offset 0)} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:00,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {2039#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2041#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:00,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {2041#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.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); {2042#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:00,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2042#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:49:00,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} assume true; {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} is VALID [2022-02-20 16:49:00,161 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2043#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)))} {2029#(= ~head~0.offset 0)} #111#return; {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} is VALID [2022-02-20 16:49:00,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {2035#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {2036#(and (= |ULTIMATE.start_search_list_~l#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2037#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} is VALID [2022-02-20 16:49:00,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {2037#(not (= |ULTIMATE.start_search_list_~l#1.base| 0))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2038#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:00,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {2038#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {2013#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {2013#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2013#false} is VALID [2022-02-20 16:49:00,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {2013#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {2013#false} assume 0 == __VERIFIER_assert_~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {2013#false} assume !false; {2013#false} is VALID [2022-02-20 16:49:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 16:49:00,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:00,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978896816] [2022-02-20 16:49:00,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978896816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:00,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976718671] [2022-02-20 16:49:00,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:49:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:00,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:49:00,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 16:49:00,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:49:00,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:00,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 16:49:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:00,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:00,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-02-20 16:49:00,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-02-20 16:49:00,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 19 [2022-02-20 16:49:00,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 13 [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {2012#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L272 TraceCheckUtils]: 2: Hoare triple {2012#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {2012#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2012#true} {2012#true} #105#return; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L272 TraceCheckUtils]: 9: Hoare triple {2012#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2012#true} {2012#true} #107#return; {2012#true} is VALID [2022-02-20 16:49:00,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L272 TraceCheckUtils]: 16: Hoare triple {2012#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2012#true} {2012#true} #109#return; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L272 TraceCheckUtils]: 23: Hoare triple {2012#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,553 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2012#true} {2012#true} #111#return; {2012#true} is VALID [2022-02-20 16:49:00,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2134#(and (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= ~head~0.offset |ULTIMATE.start_main_~mylist~0#1.offset|))} is VALID [2022-02-20 16:49:00,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {2134#(and (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= ~head~0.offset |ULTIMATE.start_main_~mylist~0#1.offset|))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2138#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} is VALID [2022-02-20 16:49:00,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {2138#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4))))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2159#(or (not (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (not (= |ULTIMATE.start_search_list_~l#1.base| 0)))} is VALID [2022-02-20 16:49:00,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {2159#(or (not (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (not (= |ULTIMATE.start_search_list_~l#1.base| 0)))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2038#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:00,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {2038#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {2013#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {2013#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2013#false} is VALID [2022-02-20 16:49:00,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {2013#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {2013#false} assume 0 == __VERIFIER_assert_~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {2013#false} assume !false; {2013#false} is VALID [2022-02-20 16:49:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 16:49:00,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:00,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {2013#false} assume !false; {2013#false} is VALID [2022-02-20 16:49:00,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {2013#false} assume 0 == __VERIFIER_assert_~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {2013#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2013#false} is VALID [2022-02-20 16:49:00,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {2013#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2013#false} is VALID [2022-02-20 16:49:00,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {2013#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {2038#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {2013#false} is VALID [2022-02-20 16:49:00,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {2159#(or (not (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (not (= |ULTIMATE.start_search_list_~l#1.base| 0)))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2038#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:00,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2159#(or (not (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (not (= |ULTIMATE.start_search_list_~l#1.base| 0)))} is VALID [2022-02-20 16:49:00,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2149#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (+ |ULTIMATE.start_search_list_~l#1.offset| 4)) 0)))} is VALID [2022-02-20 16:49:00,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {2217#(or (and (= |ULTIMATE.start_main_~mylist~0#1.base| 0) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0)) (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2142#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {2221#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2217#(or (and (= |ULTIMATE.start_main_~mylist~0#1.base| 0) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0)) (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2221#(or (not (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (+ ~head~0.offset 4)) 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (+ ~head~0.offset 4)) 0)))} is VALID [2022-02-20 16:49:00,816 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2012#true} {2012#true} #111#return; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L272 TraceCheckUtils]: 23: Hoare triple {2012#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2012#true} {2012#true} #109#return; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L272 TraceCheckUtils]: 16: Hoare triple {2012#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2012#true} {2012#true} #107#return; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2012#true} 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); {2012#true} is VALID [2022-02-20 16:49:00,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L272 TraceCheckUtils]: 9: Hoare triple {2012#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {2012#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2012#true} {2012#true} #105#return; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {2012#true} assume true; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {2012#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {2012#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {2012#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L272 TraceCheckUtils]: 2: Hoare triple {2012#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {2012#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {2012#true} is VALID [2022-02-20 16:49:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 16:49:00,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976718671] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:00,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:49:00,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-02-20 16:49:00,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680367610] [2022-02-20 16:49:00,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-02-20 16:49:00,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:00,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:00,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:00,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 16:49:00,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:49:00,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 16:49:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-02-20 16:49:00,860 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:01,886 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-02-20 16:49:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 16:49:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-02-20 16:49:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-02-20 16:49:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-02-20 16:49:01,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-02-20 16:49:01,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:01,939 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:49:01,939 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:49:01,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2022-02-20 16:49:01,940 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 107 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:01,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 167 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:49:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:49:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-02-20 16:49:01,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:01,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:01,944 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:01,944 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:01,946 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-02-20 16:49:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-02-20 16:49:01,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:01,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:01,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 44 states. [2022-02-20 16:49:01,946 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 44 states. [2022-02-20 16:49:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:01,948 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-02-20 16:49:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-02-20 16:49:01,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:01,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:01,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:01,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-02-20 16:49:01,949 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 44 [2022-02-20 16:49:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:01,949 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-02-20 16:49:01,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 16:49:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:49:01,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:01,950 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:01,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:02,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:02,165 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1693757662, now seen corresponding path program 3 times [2022-02-20 16:49:02,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:49:02,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647211214] [2022-02-20 16:49:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:49:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:49:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2544#true} is VALID [2022-02-20 16:49:02,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {2544#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2544#true} is VALID [2022-02-20 16:49:02,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {2544#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2544#true} is VALID [2022-02-20 16:49:02,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {2544#true} assume true; {2544#true} is VALID [2022-02-20 16:49:02,312 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2544#true} {2544#true} #105#return; {2544#true} is VALID [2022-02-20 16:49:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:49:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2573#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:02,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2573#(= insert_list_~l.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); {2573#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:02,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2573#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {2556#(= ~head~0.offset 0)} assume true; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,337 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2556#(= ~head~0.offset 0)} {2544#true} #107#return; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 16:49:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2574#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} is VALID [2022-02-20 16:49:02,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} 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); {2575#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} is VALID [2022-02-20 16:49:02,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {2575#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} assume true; {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,407 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} {2556#(= ~head~0.offset 0)} #109#return; {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:49:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2577#(and (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= (select |old(#valid)| insert_list_~l.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:02,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {2577#(and (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= (select |old(#valid)| insert_list_~l.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= insert_list_~l.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); {2578#(and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base (select |#memory_$Pointer$.base| insert_list_~l.base)) |#memory_$Pointer$.base|) (= (select |old(#valid)| insert_list_~l.base) 0) (= insert_list_~l.offset 0) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) 4) |old(~head~0.offset)|) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} is VALID [2022-02-20 16:49:02,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2578#(and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base (select |#memory_$Pointer$.base| insert_list_~l.base)) |#memory_$Pointer$.base|) (= (select |old(#valid)| insert_list_~l.base) 0) (= insert_list_~l.offset 0) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) 4) |old(~head~0.offset)|) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} is VALID [2022-02-20 16:49:02,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} assume true; {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} is VALID [2022-02-20 16:49:02,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} #111#return; {2568#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 4) 0)) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0))} is VALID [2022-02-20 16:49:02,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {2544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);~head~0.base, ~head~0.offset := 0, 0; {2544#true} is VALID [2022-02-20 16:49:02,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {2544#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0, 0;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L272 TraceCheckUtils]: 2: Hoare triple {2544#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2); {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:02,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {2544#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {2544#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {2544#true} assume true; {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2544#true} {2544#true} #105#return; {2544#true} is VALID [2022-02-20 16:49:02,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#true} assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;havoc main_#t~ret39#1; {2544#true} is VALID [2022-02-20 16:49:02,513 INFO L272 TraceCheckUtils]: 9: Hoare triple {2544#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5); {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:02,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2573#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:02,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {2573#(= insert_list_~l.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); {2573#(= insert_list_~l.offset 0)} is VALID [2022-02-20 16:49:02,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {2573#(= insert_list_~l.offset 0)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(= ~head~0.offset 0)} assume true; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,514 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2556#(= ~head~0.offset 0)} {2544#true} #107#return; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {2556#(= ~head~0.offset 0)} assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;havoc main_#t~ret40#1; {2556#(= ~head~0.offset 0)} is VALID [2022-02-20 16:49:02,516 INFO L272 TraceCheckUtils]: 16: Hoare triple {2556#(= ~head~0.offset 0)} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1); {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:02,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2574#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} is VALID [2022-02-20 16:49:02,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {2574#(and (= ~head~0.offset |old(~head~0.offset)|) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} 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); {2575#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} is VALID [2022-02-20 16:49:02,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {2575#(and (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4)) 0))) (= insert_list_~l.offset 0) (= (select |#valid| insert_list_~l.base) 1))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} assume true; {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,519 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2576#(and (<= ~head~0.offset 0) (or (not (= |old(~head~0.offset)| 0)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0))) (< 0 (+ ~head~0.offset 1)) (= (select |#valid| ~head~0.base) 1))} {2556#(= ~head~0.offset 0)} #109#return; {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;havoc main_#t~ret41#1; {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} is VALID [2022-02-20 16:49:02,520 INFO L272 TraceCheckUtils]: 23: Hoare triple {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3); {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:49:02,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {2572#(and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2577#(and (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= (select |old(#valid)| insert_list_~l.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= insert_list_~l.offset 0))} is VALID [2022-02-20 16:49:02,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {2577#(and (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset |old(~head~0.offset)|) (= (select |old(#valid)| insert_list_~l.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= insert_list_~l.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); {2578#(and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base (select |#memory_$Pointer$.base| insert_list_~l.base)) |#memory_$Pointer$.base|) (= (select |old(#valid)| insert_list_~l.base) 0) (= insert_list_~l.offset 0) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) 4) |old(~head~0.offset)|) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} is VALID [2022-02-20 16:49:02,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {2578#(and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base (select |#memory_$Pointer$.base| insert_list_~l.base)) |#memory_$Pointer$.base|) (= (select |old(#valid)| insert_list_~l.base) 0) (= insert_list_~l.offset 0) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) 4) |old(~head~0.offset)|) (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| insert_list_~l.base) (+ insert_list_~l.offset 4))))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} is VALID [2022-02-20 16:49:02,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} assume true; {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} is VALID [2022-02-20 16:49:02,524 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2579#(and (= |old(~head~0.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (= ~head~0.offset 0) (or (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 0) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)))) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) 4)))} {2562#(and (= ~head~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) 4) 0)) (= (select |#valid| ~head~0.base) 1))} #111#return; {2568#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 4) 0)) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0))} is VALID [2022-02-20 16:49:02,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {2568#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) 4)) 4) 0)) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) 4) 0))} assume -2147483648 <= main_#t~ret42#1 && main_#t~ret42#1 <= 2147483647;havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2569#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4))) 4) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} is VALID [2022-02-20 16:49:02,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {2569#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4))) 4) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2570#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0)) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0))} is VALID [2022-02-20 16:49:02,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {2570#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (+ |ULTIMATE.start_main_~mylist~0#1.offset| 4)) 0)) (= |ULTIMATE.start_main_~mylist~0#1.offset| 0))} assume !!(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, 4 + main_~mylist~0#1.offset, 4);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2571#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} is VALID [2022-02-20 16:49:02,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(not (= |ULTIMATE.start_main_~mylist~0#1.base| 0))} assume !(main_~mylist~0#1.base != 0 || main_~mylist~0#1.offset != 0); {2545#false} is VALID [2022-02-20 16:49:02,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {2545#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {2545#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {2545#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {2545#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {2545#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {2545#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~int(search_list_~l#1.base, search_list_~l#1.offset, 4);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {2545#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, 4 + search_list_~l#1.offset, 4);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {2545#false} search_list_#t~short32#1 := search_list_~l#1.base != 0 || search_list_~l#1.offset != 0; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {2545#false} assume !search_list_#t~short32#1; {2545#false} is VALID [2022-02-20 16:49:02,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {2545#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2545#false} is VALID [2022-02-20 16:49:02,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {2545#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2545#false} is VALID [2022-02-20 16:49:02,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {2545#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~int(main_~temp~0#1.base, main_~temp~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_#t~mem45#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2545#false} is VALID [2022-02-20 16:49:02,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {2545#false} assume 0 == __VERIFIER_assert_~cond#1; {2545#false} is VALID [2022-02-20 16:49:02,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2022-02-20 16:49:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:49:02,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:49:02,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647211214] [2022-02-20 16:49:02,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647211214] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:02,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430842811] [2022-02-20 16:49:02,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:49:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:02,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:49:02,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 16:49:02,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 16:49:02,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:02,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-20 16:49:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:02,714 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:49:02,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:02,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:49:02,928 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inconsistent result of live variables analysis at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.RelevantVariables.computePredecessorRvCall_NonPending(RelevantVariables.java:627) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.RelevantVariables.computeBackwardRelevantVariables(RelevantVariables.java:501) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.RelevantVariables.computeBackwardRelevantVariables(RelevantVariables.java:477) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.RelevantVariables.(RelevantVariables.java:76) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:281) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:49:02,931 INFO L158 Benchmark]: Toolchain (without parser) took 10247.74ms. Allocated memory was 94.4MB in the beginning and 220.2MB in the end (delta: 125.8MB). Free memory was 61.9MB in the beginning and 130.6MB in the end (delta: -68.7MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,931 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:49:02,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.49ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.7MB in the beginning and 90.7MB in the end (delta: -29.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.07ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 88.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,932 INFO L158 Benchmark]: Boogie Preprocessor took 50.18ms. Allocated memory is still 132.1MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,932 INFO L158 Benchmark]: RCFGBuilder took 335.82ms. Allocated memory is still 132.1MB. Free memory was 86.1MB in the beginning and 102.6MB in the end (delta: -16.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,932 INFO L158 Benchmark]: TraceAbstraction took 9405.01ms. Allocated memory was 132.1MB in the beginning and 220.2MB in the end (delta: 88.1MB). Free memory was 101.5MB in the beginning and 130.6MB in the end (delta: -29.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2022-02-20 16:49:02,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.49ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 61.7MB in the beginning and 90.7MB in the end (delta: -29.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.07ms. Allocated memory is still 132.1MB. Free memory was 90.7MB in the beginning and 88.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.18ms. Allocated memory is still 132.1MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.82ms. Allocated memory is still 132.1MB. Free memory was 86.1MB in the beginning and 102.6MB in the end (delta: -16.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9405.01ms. Allocated memory was 132.1MB in the beginning and 220.2MB in the end (delta: 88.1MB). Free memory was 101.5MB in the beginning and 130.6MB in the end (delta: -29.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inconsistent result of live variables analysis de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inconsistent result of live variables analysis: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.RelevantVariables.computePredecessorRvCall_NonPending(RelevantVariables.java:627) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:49:02,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:49:04,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:49:04,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:49:04,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:49:04,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:49:04,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:49:04,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:49:04,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:49:04,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:49:04,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:49:04,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:49:04,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:49:04,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:49:04,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:49:04,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:49:04,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:49:04,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:49:04,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:49:04,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:49:04,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:49:04,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:49:04,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:49:04,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:49:04,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:49:04,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:49:04,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:49:04,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:49:04,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:49:04,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:49:04,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:49:04,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:49:04,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:49:04,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:49:04,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:49:04,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:49:04,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:49:04,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:49:04,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:49:04,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:49:04,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:49:04,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:49:04,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:49:04,722 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:49:04,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:49:04,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:49:04,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:49:04,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:49:04,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:49:04,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:49:04,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:49:04,726 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:49:04,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:49:04,726 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:49:04,727 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:49:04,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:49:04,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:49:04,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:49:04,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:49:04,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:04,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:49:04,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:49:04,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:49:04,730 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2022-02-20 16:49:04,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:49:04,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:49:04,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:49:04,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:49:04,996 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:49:04,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2022-02-20 16:49:05,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfb5741b/88151441afc34d3bb29742840a2b6ab1/FLAGdb81c405c [2022-02-20 16:49:05,502 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:49:05,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2022-02-20 16:49:05,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfb5741b/88151441afc34d3bb29742840a2b6ab1/FLAGdb81c405c [2022-02-20 16:49:05,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecfb5741b/88151441afc34d3bb29742840a2b6ab1 [2022-02-20 16:49:05,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:49:05,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:49:05,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:05,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:49:05,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:49:05,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:05" (1/1) ... [2022-02-20 16:49:05,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325745b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:05, skipping insertion in model container [2022-02-20 16:49:05,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:49:05" (1/1) ... [2022-02-20 16:49:05,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:49:05,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:05,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2022-02-20 16:49:05,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:05,885 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 16:49:05,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:49:05,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2022-02-20 16:49:05,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:05,948 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:49:05,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i[813,826] [2022-02-20 16:49:05,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:49:06,045 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:49:06,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06 WrapperNode [2022-02-20 16:49:06,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:49:06,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:06,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:49:06,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:49:06,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,110 INFO L137 Inliner]: procedures = 229, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2022-02-20 16:49:06,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:49:06,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:49:06,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:49:06,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:49:06,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:49:06,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:49:06,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:49:06,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:49:06,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (1/1) ... [2022-02-20 16:49:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:49:06,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:49:06,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:49:06,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:49:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:49:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:49:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:49:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:49:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:49:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:49:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:49:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:49:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-02-20 16:49:06,223 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-02-20 16:49:06,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:49:06,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:49:06,376 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:49:06,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:49:06,676 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:49:06,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:49:06,684 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:49:06,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:06 BoogieIcfgContainer [2022-02-20 16:49:06,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:49:06,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:49:06,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:49:06,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:49:06,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:49:05" (1/3) ... [2022-02-20 16:49:06,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae84b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:06, skipping insertion in model container [2022-02-20 16:49:06,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:49:06" (2/3) ... [2022-02-20 16:49:06,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae84b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:49:06, skipping insertion in model container [2022-02-20 16:49:06,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:49:06" (3/3) ... [2022-02-20 16:49:06,689 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2022-02-20 16:49:06,693 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:49:06,693 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:49:06,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:49:06,724 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:49:06,724 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:49:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:49:06,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:06,742 INFO L514 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] [2022-02-20 16:49:06,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1135484681, now seen corresponding path program 1 times [2022-02-20 16:49:06,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:06,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155266959] [2022-02-20 16:49:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:06,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:06,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:49:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:06,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:49:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:06,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:07,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {39#true} is VALID [2022-02-20 16:49:07,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {39#true} is VALID [2022-02-20 16:49:07,112 INFO L272 TraceCheckUtils]: 2: Hoare triple {39#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {39#true} is VALID [2022-02-20 16:49:07,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:49:07,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {39#true} is VALID [2022-02-20 16:49:07,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {39#true} is VALID [2022-02-20 16:49:07,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:49:07,114 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {39#true} {39#true} #105#return; {39#true} is VALID [2022-02-20 16:49:07,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} havoc main_#t~ret39#1; {39#true} is VALID [2022-02-20 16:49:07,114 INFO L272 TraceCheckUtils]: 9: Hoare triple {39#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {39#true} is VALID [2022-02-20 16:49:07,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:49:07,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {39#true} is VALID [2022-02-20 16:49:07,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {39#true} is VALID [2022-02-20 16:49:07,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:49:07,115 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {39#true} {39#true} #107#return; {39#true} is VALID [2022-02-20 16:49:07,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#true} havoc main_#t~ret40#1; {39#true} is VALID [2022-02-20 16:49:07,115 INFO L272 TraceCheckUtils]: 16: Hoare triple {39#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {39#true} is VALID [2022-02-20 16:49:07,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:49:07,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {39#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {39#true} is VALID [2022-02-20 16:49:07,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {39#true} is VALID [2022-02-20 16:49:07,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:49:07,117 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {39#true} {39#true} #109#return; {39#true} is VALID [2022-02-20 16:49:07,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {39#true} havoc main_#t~ret41#1; {39#true} is VALID [2022-02-20 16:49:07,118 INFO L272 TraceCheckUtils]: 23: Hoare triple {39#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {39#true} is VALID [2022-02-20 16:49:07,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {39#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {39#true} is VALID [2022-02-20 16:49:07,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {39#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {39#true} is VALID [2022-02-20 16:49:07,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {39#true} is VALID [2022-02-20 16:49:07,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {39#true} assume true; {39#true} is VALID [2022-02-20 16:49:07,119 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {39#true} {39#true} #111#return; {39#true} is VALID [2022-02-20 16:49:07,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {39#true} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {39#true} is VALID [2022-02-20 16:49:07,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {39#true} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {39#true} is VALID [2022-02-20 16:49:07,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {39#true} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {39#true} is VALID [2022-02-20 16:49:07,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:49:07,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {40#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {40#false} is VALID [2022-02-20 16:49:07,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {40#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {40#false} is VALID [2022-02-20 16:49:07,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {40#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {40#false} is VALID [2022-02-20 16:49:07,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:49:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 16:49:07,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:07,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:07,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155266959] [2022-02-20 16:49:07,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155266959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:07,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:07,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:49:07,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557687041] [2022-02-20 16:49:07,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 16:49:07,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:07,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:07,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:07,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:49:07,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:49:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:49:07,196 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:07,281 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2022-02-20 16:49:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:49:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 16:49:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2022-02-20 16:49:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2022-02-20 16:49:07,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2022-02-20 16:49:07,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:07,372 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:49:07,372 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:49:07,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:49:07,376 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:07,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:49:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:49:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:49:07,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:07,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:07,397 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:07,398 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:07,401 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:49:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:49:07,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:07,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:07,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-02-20 16:49:07,402 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-02-20 16:49:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:07,405 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:49:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:49:07,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:07,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:07,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:07,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:49:07,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 37 [2022-02-20 16:49:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:07,409 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:49:07,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:49:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:49:07,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:07,411 INFO L514 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] [2022-02-20 16:49:07,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:07,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:07,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1275349378, now seen corresponding path program 1 times [2022-02-20 16:49:07,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:07,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321141482] [2022-02-20 16:49:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:07,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:07,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:49:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:07,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:49:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:07,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:07,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {310#true} is VALID [2022-02-20 16:49:07,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {310#true} is VALID [2022-02-20 16:49:07,993 INFO L272 TraceCheckUtils]: 2: Hoare triple {310#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {310#true} is VALID [2022-02-20 16:49:07,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {324#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:07,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {324#(not (= insert_list_~l.base (_ bv0 32)))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {324#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:07,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {324#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:07,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} assume true; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:07,997 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {331#(not (= (_ bv0 32) ~head~0.base))} {310#true} #105#return; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:07,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret39#1; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:07,998 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {344#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:07,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {344#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:08,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#(= |old(~head~0.base)| (_ bv0 32))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(= |old(~head~0.base)| (_ bv0 32))} assume true; {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,007 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {351#(= |old(~head~0.base)| (_ bv0 32))} {331#(not (= (_ bv0 32) ~head~0.base))} #107#return; {311#false} is VALID [2022-02-20 16:49:08,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {311#false} havoc main_#t~ret40#1; {311#false} is VALID [2022-02-20 16:49:08,008 INFO L272 TraceCheckUtils]: 16: Hoare triple {311#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {311#false} is VALID [2022-02-20 16:49:08,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {311#false} is VALID [2022-02-20 16:49:08,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#false} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {311#false} is VALID [2022-02-20 16:49:08,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {311#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {311#false} is VALID [2022-02-20 16:49:08,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {311#false} assume true; {311#false} is VALID [2022-02-20 16:49:08,009 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {311#false} {311#false} #109#return; {311#false} is VALID [2022-02-20 16:49:08,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#false} havoc main_#t~ret41#1; {311#false} is VALID [2022-02-20 16:49:08,010 INFO L272 TraceCheckUtils]: 23: Hoare triple {311#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {311#false} is VALID [2022-02-20 16:49:08,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {311#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {311#false} is VALID [2022-02-20 16:49:08,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {311#false} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {311#false} is VALID [2022-02-20 16:49:08,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {311#false} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {311#false} is VALID [2022-02-20 16:49:08,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {311#false} assume true; {311#false} is VALID [2022-02-20 16:49:08,011 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {311#false} {311#false} #111#return; {311#false} is VALID [2022-02-20 16:49:08,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {311#false} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {311#false} is VALID [2022-02-20 16:49:08,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {311#false} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {311#false} is VALID [2022-02-20 16:49:08,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {311#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {311#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {311#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {311#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {311#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {311#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {311#false} is VALID [2022-02-20 16:49:08,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {311#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {311#false} is VALID [2022-02-20 16:49:08,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 16:49:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:49:08,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:08,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 16:49:08,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {311#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {311#false} is VALID [2022-02-20 16:49:08,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {311#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {311#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {311#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {311#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {311#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {311#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {311#false} is VALID [2022-02-20 16:49:08,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {311#false} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {311#false} is VALID [2022-02-20 16:49:08,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {311#false} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {311#false} is VALID [2022-02-20 16:49:08,179 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {310#true} {311#false} #111#return; {311#false} is VALID [2022-02-20 16:49:08,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 16:49:08,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {310#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {310#true} is VALID [2022-02-20 16:49:08,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {310#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {310#true} is VALID [2022-02-20 16:49:08,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {310#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {310#true} is VALID [2022-02-20 16:49:08,180 INFO L272 TraceCheckUtils]: 23: Hoare triple {311#false} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {310#true} is VALID [2022-02-20 16:49:08,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#false} havoc main_#t~ret41#1; {311#false} is VALID [2022-02-20 16:49:08,180 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {310#true} {311#false} #109#return; {311#false} is VALID [2022-02-20 16:49:08,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#true} assume true; {310#true} is VALID [2022-02-20 16:49:08,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {310#true} is VALID [2022-02-20 16:49:08,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {310#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {310#true} is VALID [2022-02-20 16:49:08,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {310#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {310#true} is VALID [2022-02-20 16:49:08,181 INFO L272 TraceCheckUtils]: 16: Hoare triple {311#false} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {310#true} is VALID [2022-02-20 16:49:08,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {311#false} havoc main_#t~ret40#1; {311#false} is VALID [2022-02-20 16:49:08,182 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {351#(= |old(~head~0.base)| (_ bv0 32))} {331#(not (= (_ bv0 32) ~head~0.base))} #107#return; {311#false} is VALID [2022-02-20 16:49:08,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(= |old(~head~0.base)| (_ bv0 32))} assume true; {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#(= |old(~head~0.base)| (_ bv0 32))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {351#(= |old(~head~0.base)| (_ bv0 32))} is VALID [2022-02-20 16:49:08,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {517#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:08,190 INFO L272 TraceCheckUtils]: 9: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {517#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:08,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret39#1; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:08,191 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {331#(not (= (_ bv0 32) ~head~0.base))} {310#true} #105#return; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:08,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(not (= (_ bv0 32) ~head~0.base))} assume true; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:08,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {324#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {331#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:08,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {324#(not (= insert_list_~l.base (_ bv0 32)))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {324#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:08,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {324#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:08,194 INFO L272 TraceCheckUtils]: 2: Hoare triple {310#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {310#true} is VALID [2022-02-20 16:49:08,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {310#true} is VALID [2022-02-20 16:49:08,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {310#true} is VALID [2022-02-20 16:49:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:49:08,195 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:08,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321141482] [2022-02-20 16:49:08,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321141482] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:08,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:08,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-02-20 16:49:08,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493779512] [2022-02-20 16:49:08,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 16:49:08,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:08,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:49:08,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:08,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:49:08,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:49:08,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:08,249 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:49:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:08,673 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-02-20 16:49:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:49:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 16:49:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:49:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-02-20 16:49:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:49:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-02-20 16:49:08,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-02-20 16:49:08,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:08,757 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:49:08,757 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:49:08,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:49:08,758 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:08,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:49:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:49:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 16:49:08,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:08,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:08,762 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:08,762 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:08,764 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:49:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:49:08,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:08,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:08,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 31 states. [2022-02-20 16:49:08,765 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 31 states. [2022-02-20 16:49:08,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:08,767 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:49:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:49:08,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:08,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:08,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:08,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:49:08,769 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 39 [2022-02-20 16:49:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:08,770 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:49:08,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 16:49:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:49:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:49:08,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:08,771 INFO L514 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] [2022-02-20 16:49:08,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:08,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:08,981 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash 177460864, now seen corresponding path program 1 times [2022-02-20 16:49:08,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:08,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161507267] [2022-02-20 16:49:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:08,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:08,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:08,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:49:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:09,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:49:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:09,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:09,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {728#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {728#true} is VALID [2022-02-20 16:49:09,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {728#true} is VALID [2022-02-20 16:49:09,241 INFO L272 TraceCheckUtils]: 2: Hoare triple {728#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {728#true} is VALID [2022-02-20 16:49:09,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {728#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {728#true} is VALID [2022-02-20 16:49:09,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {728#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {728#true} is VALID [2022-02-20 16:49:09,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {728#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {728#true} is VALID [2022-02-20 16:49:09,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:49:09,244 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {728#true} {728#true} #105#return; {728#true} is VALID [2022-02-20 16:49:09,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {728#true} havoc main_#t~ret39#1; {728#true} is VALID [2022-02-20 16:49:09,245 INFO L272 TraceCheckUtils]: 9: Hoare triple {728#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {728#true} is VALID [2022-02-20 16:49:09,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {728#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {728#true} is VALID [2022-02-20 16:49:09,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {728#true} is VALID [2022-02-20 16:49:09,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {728#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {728#true} is VALID [2022-02-20 16:49:09,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:49:09,246 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {728#true} {728#true} #107#return; {728#true} is VALID [2022-02-20 16:49:09,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {728#true} havoc main_#t~ret40#1; {728#true} is VALID [2022-02-20 16:49:09,246 INFO L272 TraceCheckUtils]: 16: Hoare triple {728#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {728#true} is VALID [2022-02-20 16:49:09,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {728#true} is VALID [2022-02-20 16:49:09,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {728#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {728#true} is VALID [2022-02-20 16:49:09,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {728#true} is VALID [2022-02-20 16:49:09,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#true} assume true; {728#true} is VALID [2022-02-20 16:49:09,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {728#true} {728#true} #109#return; {728#true} is VALID [2022-02-20 16:49:09,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#true} havoc main_#t~ret41#1; {728#true} is VALID [2022-02-20 16:49:09,247 INFO L272 TraceCheckUtils]: 23: Hoare triple {728#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {728#true} is VALID [2022-02-20 16:49:09,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {728#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {805#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:09,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {805#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {805#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:09,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {805#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {812#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:09,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(not (= (_ bv0 32) ~head~0.base))} assume true; {812#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:09,250 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {812#(not (= (_ bv0 32) ~head~0.base))} {728#true} #111#return; {812#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:09,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {812#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {822#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:09,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {822#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {729#false} is VALID [2022-02-20 16:49:09,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {729#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {729#false} is VALID [2022-02-20 16:49:09,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {729#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {729#false} is VALID [2022-02-20 16:49:09,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {729#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {729#false} is VALID [2022-02-20 16:49:09,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {729#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {729#false} is VALID [2022-02-20 16:49:09,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {729#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {729#false} is VALID [2022-02-20 16:49:09,260 INFO L290 TraceCheckUtils]: 36: Hoare triple {729#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {729#false} is VALID [2022-02-20 16:49:09,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {729#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {729#false} is VALID [2022-02-20 16:49:09,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {729#false} assume !false; {729#false} is VALID [2022-02-20 16:49:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 16:49:09,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:09,262 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:09,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161507267] [2022-02-20 16:49:09,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161507267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:09,264 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:09,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:49:09,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448168076] [2022-02-20 16:49:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:09,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-02-20 16:49:09,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:09,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:09,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:09,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:49:09,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:49:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:49:09,300 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:09,642 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 16:49:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:49:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-02-20 16:49:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 16:49:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 16:49:09,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-02-20 16:49:09,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:09,700 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:49:09,700 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:49:09,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:09,701 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:09,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:49:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:49:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 16:49:09,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:09,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:09,704 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:09,705 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:09,707 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:49:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:49:09,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:09,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:09,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:49:09,708 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Second operand 32 states. [2022-02-20 16:49:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:09,709 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:49:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 16:49:09,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:09,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:09,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:09,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 16:49:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 16:49:09,711 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 39 [2022-02-20 16:49:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:09,712 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 16:49:09,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:49:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:49:09,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:09,713 INFO L514 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] [2022-02-20 16:49:09,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:09,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:09,922 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 104078038, now seen corresponding path program 1 times [2022-02-20 16:49:09,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:09,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047766629] [2022-02-20 16:49:09,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:09,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:09,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:09,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:09,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:49:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:10,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 16:49:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:10,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:10,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:10,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2022-02-20 16:49:10,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {1011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1011#true} is VALID [2022-02-20 16:49:10,344 INFO L272 TraceCheckUtils]: 2: Hoare triple {1011#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {1011#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {1011#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1011#true} {1011#true} #105#return; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#true} havoc main_#t~ret39#1; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L272 TraceCheckUtils]: 9: Hoare triple {1011#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1011#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {1011#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 16:49:10,345 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1011#true} {1011#true} #107#return; {1011#true} is VALID [2022-02-20 16:49:10,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#true} havoc main_#t~ret40#1; {1011#true} is VALID [2022-02-20 16:49:10,346 INFO L272 TraceCheckUtils]: 16: Hoare triple {1011#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {1011#true} is VALID [2022-02-20 16:49:10,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1067#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:10,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {1067#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1067#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:10,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} assume true; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,348 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1074#(not (= (_ bv0 32) ~head~0.base))} {1011#true} #109#return; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret41#1; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,349 INFO L272 TraceCheckUtils]: 23: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {1087#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:10,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {1087#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1091#(and (= |old(~head~0.base)| ~head~0.base) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:10,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {1091#(and (= |old(~head~0.base)| ~head~0.base) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1095#(and (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:10,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {1095#(and (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1099#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:10,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {1099#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {1099#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:10,352 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1099#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {1074#(not (= (_ bv0 32) ~head~0.base))} #111#return; {1106#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:10,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {1106#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1110#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:49:10,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1114#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {1114#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {1012#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {1012#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {1012#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {1012#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {1012#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {1012#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {1012#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1012#false} is VALID [2022-02-20 16:49:10,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 16:49:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:49:10,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:10,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {1012#false} assume !false; {1012#false} is VALID [2022-02-20 16:49:10,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {1012#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1012#false} is VALID [2022-02-20 16:49:10,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {1012#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1012#false} is VALID [2022-02-20 16:49:10,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {1012#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1012#false} is VALID [2022-02-20 16:49:10,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {1012#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1012#false} is VALID [2022-02-20 16:49:10,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {1012#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1012#false} is VALID [2022-02-20 16:49:10,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {1012#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {1012#false} is VALID [2022-02-20 16:49:10,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {1012#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1012#false} is VALID [2022-02-20 16:49:10,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {1114#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {1012#false} is VALID [2022-02-20 16:49:10,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {1169#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1114#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {1173#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1169#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:49:10,679 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1180#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} {1074#(not (= (_ bv0 32) ~head~0.base))} #111#return; {1173#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:10,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {1180#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} assume true; {1180#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {1187#(or (= |old(~head~0.base)| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1180#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {1191#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1187#(or (= |old(~head~0.base)| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) (_ bv0 32))))} is VALID [2022-02-20 16:49:10,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {1191#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1191#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,684 INFO L272 TraceCheckUtils]: 23: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {1191#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:10,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret41#1; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,685 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1074#(not (= (_ bv0 32) ~head~0.base))} {1011#true} #109#return; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(not (= (_ bv0 32) ~head~0.base))} assume true; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1074#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:10,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {1067#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1067#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:10,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1067#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:10,687 INFO L272 TraceCheckUtils]: 16: Hoare triple {1011#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#true} havoc main_#t~ret40#1; {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1011#true} {1011#true} #107#return; {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1011#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1011#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1011#true} is VALID [2022-02-20 16:49:10,688 INFO L272 TraceCheckUtils]: 9: Hoare triple {1011#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1011#true} havoc main_#t~ret39#1; {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1011#true} {1011#true} #105#return; {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1011#true} assume true; {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {1011#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {1011#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {1011#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1011#true} is VALID [2022-02-20 16:49:10,689 INFO L272 TraceCheckUtils]: 2: Hoare triple {1011#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {1011#true} is VALID [2022-02-20 16:49:10,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1011#true} is VALID [2022-02-20 16:49:10,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1011#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1011#true} is VALID [2022-02-20 16:49:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:49:10,697 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:10,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047766629] [2022-02-20 16:49:10,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047766629] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:10,697 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:10,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-02-20 16:49:10,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086497750] [2022-02-20 16:49:10,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 16:49:10,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:10,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:10,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:10,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 16:49:10,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:10,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 16:49:10,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:49:10,754 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:12,465 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-02-20 16:49:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 16:49:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-02-20 16:49:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-02-20 16:49:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-02-20 16:49:12,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2022-02-20 16:49:12,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:12,535 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:49:12,535 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:49:12,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-02-20 16:49:12,536 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 60 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:12,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 16:49:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:49:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-02-20 16:49:12,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:12,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:12,540 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:12,540 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:12,541 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 16:49:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 16:49:12,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:12,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:12,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-02-20 16:49:12,542 INFO L87 Difference]: Start difference. First operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-02-20 16:49:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:12,543 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 16:49:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 16:49:12,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:12,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:12,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:12,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-02-20 16:49:12,545 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2022-02-20 16:49:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:12,546 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-02-20 16:49:12,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 16:49:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 16:49:12,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:12,547 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-20 16:49:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:12,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:12,756 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2124177728, now seen corresponding path program 2 times [2022-02-20 16:49:12,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:12,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733482514] [2022-02-20 16:49:12,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:49:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:12,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:12,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:12,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:49:12,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:49:12,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:12,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:49:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:12,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {1473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L272 TraceCheckUtils]: 2: Hoare triple {1473#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {1473#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {1473#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1473#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1473#true} is VALID [2022-02-20 16:49:13,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1473#true} {1473#true} #105#return; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {1473#true} havoc main_#t~ret39#1; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L272 TraceCheckUtils]: 9: Hoare triple {1473#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {1473#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {1473#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1473#true} {1473#true} #107#return; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1473#true} havoc main_#t~ret40#1; {1473#true} is VALID [2022-02-20 16:49:13,057 INFO L272 TraceCheckUtils]: 16: Hoare triple {1473#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {1473#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#true} {1473#true} #109#return; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {1473#true} havoc main_#t~ret41#1; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L272 TraceCheckUtils]: 23: Hoare triple {1473#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {1473#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {1473#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1473#true} is VALID [2022-02-20 16:49:13,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-02-20 16:49:13,059 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1473#true} {1473#true} #111#return; {1473#true} is VALID [2022-02-20 16:49:13,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {1473#true} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1473#true} is VALID [2022-02-20 16:49:13,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {1473#true} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1473#true} is VALID [2022-02-20 16:49:13,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {1473#true} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1473#true} is VALID [2022-02-20 16:49:13,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {1473#true} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {1473#true} is VALID [2022-02-20 16:49:13,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {1473#true} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1577#(= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|)} is VALID [2022-02-20 16:49:13,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {1577#(= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|)} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {1577#(= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|)} is VALID [2022-02-20 16:49:13,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {1577#(= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|)} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {1584#(or (and |ULTIMATE.start_search_list_#t~short32#1| (not (= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32)))) (and (= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32)) (not |ULTIMATE.start_search_list_#t~short32#1|)))} is VALID [2022-02-20 16:49:13,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {1584#(or (and |ULTIMATE.start_search_list_#t~short32#1| (not (= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32)))) (and (= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32)) (not |ULTIMATE.start_search_list_#t~short32#1|)))} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1588#(= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32))} is VALID [2022-02-20 16:49:13,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {1588#(= (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_~l#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv2 32))} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1592#(= (_ bv2 32) (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_#res#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_#res#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_#res#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) |ULTIMATE.start_search_list_#res#1.offset|)))} is VALID [2022-02-20 16:49:13,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {1592#(= (_ bv2 32) (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_search_list_#res#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_search_list_#res#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) (bvadd (_ bv1 32) |ULTIMATE.start_search_list_#res#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_search_list_#res#1.base|) |ULTIMATE.start_search_list_#res#1.offset|)))} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1596#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 16:49:13,067 INFO L290 TraceCheckUtils]: 39: Hoare triple {1596#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {1474#false} is VALID [2022-02-20 16:49:13,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {1474#false} assume !false; {1474#false} is VALID [2022-02-20 16:49:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 16:49:13,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:13,067 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:13,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733482514] [2022-02-20 16:49:13,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733482514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:13,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:13,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:49:13,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302934193] [2022-02-20 16:49:13,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:13,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-02-20 16:49:13,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:13,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:13,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:13,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:49:13,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:13,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:49:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:49:13,098 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:13,741 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 16:49:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:49:13,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-02-20 16:49:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-02-20 16:49:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-02-20 16:49:13,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-02-20 16:49:13,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:13,783 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:49:13,783 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:49:13,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:49:13,783 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:13,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:49:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:49:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:49:13,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:13,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:13,786 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:13,787 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:13,788 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 16:49:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 16:49:13,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:13,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:13,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 16:49:13,793 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-02-20 16:49:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:13,794 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 16:49:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 16:49:13,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:13,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:13,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:13,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-02-20 16:49:13,796 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 41 [2022-02-20 16:49:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:13,796 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-02-20 16:49:13,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 16:49:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 16:49:13,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:13,797 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-20 16:49:13,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:14,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:14,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2113531266, now seen corresponding path program 1 times [2022-02-20 16:49:14,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:14,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693011709] [2022-02-20 16:49:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:14,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:14,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:14,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:49:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:14,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:49:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:14,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:14,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {1770#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1770#true} is VALID [2022-02-20 16:49:14,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {1770#true} is VALID [2022-02-20 16:49:14,247 INFO L272 TraceCheckUtils]: 2: Hoare triple {1770#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {1770#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {1770#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1770#true} {1770#true} #105#return; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#true} havoc main_#t~ret39#1; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L272 TraceCheckUtils]: 9: Hoare triple {1770#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {1770#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1770#true} is VALID [2022-02-20 16:49:14,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {1770#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1770#true} {1770#true} #107#return; {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#true} havoc main_#t~ret40#1; {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L272 TraceCheckUtils]: 16: Hoare triple {1770#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1770#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1770#true} is VALID [2022-02-20 16:49:14,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {1770#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1770#true} is VALID [2022-02-20 16:49:14,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1770#true} is VALID [2022-02-20 16:49:14,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-02-20 16:49:14,250 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1770#true} {1770#true} #109#return; {1770#true} is VALID [2022-02-20 16:49:14,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1770#true} havoc main_#t~ret41#1; {1770#true} is VALID [2022-02-20 16:49:14,250 INFO L272 TraceCheckUtils]: 23: Hoare triple {1770#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {1770#true} is VALID [2022-02-20 16:49:14,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {1770#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {1847#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:14,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {1847#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:14,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {1847#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} assume true; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,254 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1854#(not (= (_ bv0 32) ~head~0.base))} {1770#true} #111#return; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {1854#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:14,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {1854#(not (= (_ bv0 32) ~head~0.base))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {1876#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:14,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {1876#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {1880#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {1880#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {1771#false} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {1771#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {1771#false} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {1771#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {1771#false} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {1771#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1771#false} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {1771#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {1771#false} is VALID [2022-02-20 16:49:14,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-02-20 16:49:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 16:49:14,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:49:14,258 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:14,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693011709] [2022-02-20 16:49:14,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693011709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:49:14,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:49:14,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:49:14,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208368441] [2022-02-20 16:49:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:49:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-02-20 16:49:14,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:14,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:14,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:14,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:49:14,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:49:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:49:14,300 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:14,753 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-20 16:49:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:49:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-02-20 16:49:14,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:49:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:49:14,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-02-20 16:49:14,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:14,800 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:49:14,800 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:49:14,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:49:14,801 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:14,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:49:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:49:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-02-20 16:49:14,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:14,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:14,804 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:14,804 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:14,805 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 16:49:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 16:49:14,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:14,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:14,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-02-20 16:49:14,806 INFO L87 Difference]: Start difference. First operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-02-20 16:49:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:14,807 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 16:49:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-20 16:49:14,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:14,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:14,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:14,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-02-20 16:49:14,809 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 41 [2022-02-20 16:49:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:14,809 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-02-20 16:49:14,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:49:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 16:49:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 16:49:14,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:14,816 INFO L514 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] [2022-02-20 16:49:14,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:15,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:15,017 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2034659567, now seen corresponding path program 1 times [2022-02-20 16:49:15,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:15,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426424211] [2022-02-20 16:49:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:49:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:15,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:15,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:49:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:15,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 16:49:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:15,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:15,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:15,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 treesize of output 8 [2022-02-20 16:49:15,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {2082#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {2082#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L272 TraceCheckUtils]: 2: Hoare triple {2082#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#true} assume true; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2082#true} {2082#true} #105#return; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#true} havoc main_#t~ret39#1; {2082#true} is VALID [2022-02-20 16:49:15,440 INFO L272 TraceCheckUtils]: 9: Hoare triple {2082#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#true} assume true; {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2082#true} {2082#true} #107#return; {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#true} havoc main_#t~ret40#1; {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L272 TraceCheckUtils]: 16: Hoare triple {2082#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {2082#true} is VALID [2022-02-20 16:49:15,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2138#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:15,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2138#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:15,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} assume true; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,443 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2145#(not (= (_ bv0 32) ~head~0.base))} {2082#true} #109#return; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret41#1; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,444 INFO L272 TraceCheckUtils]: 23: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {2158#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:15,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {2158#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2162#(and (= |old(~head~0.base)| ~head~0.base) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:15,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {2162#(and (= |old(~head~0.base)| ~head~0.base) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2166#(and (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:15,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {2166#(and (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2170#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:15,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {2170#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {2170#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:15,448 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2170#(and (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {2145#(not (= (_ bv0 32) ~head~0.base))} #111#return; {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:15,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:15,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:15,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:15,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:15,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {2177#(and (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:15,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:15,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:15,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2203#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2207#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:15,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {2207#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {2207#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:15,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {2207#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2083#false} is VALID [2022-02-20 16:49:15,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {2083#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2083#false} is VALID [2022-02-20 16:49:15,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {2083#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2083#false} is VALID [2022-02-20 16:49:15,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {2083#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2083#false} is VALID [2022-02-20 16:49:15,454 INFO L290 TraceCheckUtils]: 43: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2022-02-20 16:49:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:49:15,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:15,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2022-02-20 16:49:15,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {2083#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2083#false} is VALID [2022-02-20 16:49:15,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {2083#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2083#false} is VALID [2022-02-20 16:49:15,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {2083#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2083#false} is VALID [2022-02-20 16:49:15,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {2207#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2083#false} is VALID [2022-02-20 16:49:15,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {2207#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {2207#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:15,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2207#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:15,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2203#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2247#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,817 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2276#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} {2145#(not (= (_ bv0 32) ~head~0.base))} #111#return; {2257#(not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)))} is VALID [2022-02-20 16:49:15,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {2276#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} assume true; {2276#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {2283#(or (= |old(~head~0.base)| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2276#(or (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {2287#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2283#(or (= |old(~head~0.base)| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) (_ bv0 32))))} is VALID [2022-02-20 16:49:15,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {2287#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2287#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,822 INFO L272 TraceCheckUtils]: 23: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {2287#(or (not (= (_ bv0 32) ~head~0.base)) (= |old(~head~0.base)| (_ bv0 32)))} is VALID [2022-02-20 16:49:15,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret41#1; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,823 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2145#(not (= (_ bv0 32) ~head~0.base))} {2082#true} #109#return; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {2145#(not (= (_ bv0 32) ~head~0.base))} assume true; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2145#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2138#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2138#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:15,828 INFO L272 TraceCheckUtils]: 16: Hoare triple {2082#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#true} havoc main_#t~ret40#1; {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2082#true} {2082#true} #107#return; {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#true} assume true; {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L272 TraceCheckUtils]: 9: Hoare triple {2082#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {2082#true} is VALID [2022-02-20 16:49:15,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#true} havoc main_#t~ret39#1; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2082#true} {2082#true} #105#return; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#true} assume true; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L272 TraceCheckUtils]: 2: Hoare triple {2082#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {2082#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {2082#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2082#true} is VALID [2022-02-20 16:49:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:49:15,830 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:15,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426424211] [2022-02-20 16:49:15,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426424211] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:15,830 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:15,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2022-02-20 16:49:15,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9078011] [2022-02-20 16:49:15,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:15,830 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-02-20 16:49:15,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:15,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:15,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:15,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 16:49:15,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 16:49:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-02-20 16:49:15,884 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:17,646 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 16:49:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 16:49:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-02-20 16:49:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-02-20 16:49:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-02-20 16:49:17,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2022-02-20 16:49:17,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:17,709 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:49:17,709 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:49:17,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 16:49:17,710 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 82 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:17,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 174 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 16:49:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:49:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-02-20 16:49:17,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:17,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:17,714 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:17,714 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:17,715 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 16:49:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 16:49:17,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:17,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:17,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:49:17,716 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:49:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:17,717 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 16:49:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 16:49:17,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:17,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:17,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:17,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-20 16:49:17,719 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 44 [2022-02-20 16:49:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:17,719 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-20 16:49:17,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 16:49:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 16:49:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:49:17,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:17,720 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:17,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 16:49:17,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:17,930 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1693757662, now seen corresponding path program 2 times [2022-02-20 16:49:17,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:17,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311828994] [2022-02-20 16:49:17,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:49:17,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:17,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:17,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:49:18,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:49:18,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:18,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 16:49:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:18,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:18,288 INFO L390 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 [2022-02-20 16:49:18,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:18,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:18,523 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:18,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:18,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-02-20 16:49:18,704 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-02-20 16:49:18,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 16:49:18,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 21 [2022-02-20 16:49:18,862 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:49:18,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-02-20 16:49:18,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2598#true} is VALID [2022-02-20 16:49:18,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L272 TraceCheckUtils]: 2: Hoare triple {2598#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2598#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2598#true} {2598#true} #105#return; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} havoc main_#t~ret39#1; {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L272 TraceCheckUtils]: 9: Hoare triple {2598#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {2598#true} is VALID [2022-02-20 16:49:18,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {2598#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2633#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:18,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {2633#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2633#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:18,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {2633#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:18,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} assume true; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:18,926 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2640#(not (= (_ bv0 32) ~head~0.base))} {2598#true} #107#return; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:18,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret40#1; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:18,927 INFO L272 TraceCheckUtils]: 16: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {2653#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:18,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {2653#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2657#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:18,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {2657#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2661#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:18,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {2661#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:18,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:18,931 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {2640#(not (= (_ bv0 32) ~head~0.base))} #109#return; {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:18,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret41#1; {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:18,932 INFO L272 TraceCheckUtils]: 23: Hoare triple {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {2679#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:18,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {2679#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2683#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:18,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {2683#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2687#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_1) |#memory_$Pointer$.base|))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:18,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {2687#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_1) |#memory_$Pointer$.base|))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:18,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} assume true; {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:18,940 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} #111#return; {2698#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:18,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {2698#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:18,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {2702#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)))) (_ bv0 32))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2706#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_27| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_27|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32))) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))))))} is VALID [2022-02-20 16:49:18,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {2706#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_27| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_27|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_27|) (_ bv4 32))) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2710#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {2710#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {2599#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {2599#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {2599#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:18,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {2599#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {2599#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {2599#false} assume !search_list_#t~short32#1; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {2599#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {2599#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {2599#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {2599#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 16:49:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:49:18,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:19,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:19,319 INFO L390 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-02-20 16:49:19,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_89 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_2 (_ bv4 32)) c_~head~0.base)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_89 v_arrayElimArr_2) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_89))))))) is different from false [2022-02-20 16:49:19,345 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:19,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311828994] [2022-02-20 16:49:19,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311828994] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:19,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1111901431] [2022-02-20 16:49:19,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:49:19,346 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:49:19,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 16:49:19,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-02-20 16:49:19,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:49:19,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:19,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 16:49:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:19,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:19,717 INFO L390 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 [2022-02-20 16:49:19,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:19,836 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:19,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:19,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 16:49:19,947 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-02-20 16:49:19,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 16:49:20,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 23 [2022-02-20 16:49:20,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2598#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {2598#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L272 TraceCheckUtils]: 2: Hoare triple {2598#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {2598#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {2598#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {2598#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {2598#true} assume true; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2598#true} {2598#true} #105#return; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {2598#true} havoc main_#t~ret39#1; {2598#true} is VALID [2022-02-20 16:49:20,212 INFO L272 TraceCheckUtils]: 9: Hoare triple {2598#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {2598#true} is VALID [2022-02-20 16:49:20,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {2598#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2633#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:20,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {2633#(not (= insert_list_~l.base (_ bv0 32)))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2633#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:20,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {2633#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:20,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} assume true; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:20,215 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2640#(not (= (_ bv0 32) ~head~0.base))} {2598#true} #107#return; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:20,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret40#1; {2640#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:20,216 INFO L272 TraceCheckUtils]: 16: Hoare triple {2640#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {2653#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:20,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {2653#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2657#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:20,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {2657#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2661#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:20,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {2661#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:20,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:20,220 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2665#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {2640#(not (= (_ bv0 32) ~head~0.base))} #109#return; {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:20,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret41#1; {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:20,221 INFO L272 TraceCheckUtils]: 23: Hoare triple {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {2679#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:20,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {2679#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {2683#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:20,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {2683#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {2687#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_1) |#memory_$Pointer$.base|))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:20,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {2687#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_1) |#memory_$Pointer$.base|))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:20,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} assume true; {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:20,229 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2691#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_1 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_1) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_1 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} {2672#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} #111#return; {2698#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:20,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {2698#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {2904#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset))} is VALID [2022-02-20 16:49:20,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {2904#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2908#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:49:20,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {2908#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {2912#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {2912#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {2599#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {2599#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {2599#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {2599#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {2599#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {2599#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {2599#false} assume !search_list_#t~short32#1; {2599#false} is VALID [2022-02-20 16:49:20,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {2599#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {2599#false} is VALID [2022-02-20 16:49:20,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {2599#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {2599#false} is VALID [2022-02-20 16:49:20,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {2599#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2599#false} is VALID [2022-02-20 16:49:20,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {2599#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {2599#false} is VALID [2022-02-20 16:49:20,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {2599#false} assume !false; {2599#false} is VALID [2022-02-20 16:49:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 16:49:20,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:20,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:20,483 INFO L390 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 1 case distinctions, treesize of input 16 treesize of output 20 [2022-02-20 16:49:20,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_97 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_97)))) (not (= (select v_arrayElimArr_4 (_ bv4 32)) c_~head~0.base)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_97 v_arrayElimArr_4) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2022-02-20 16:49:20,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1111901431] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:20,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:20,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 20 [2022-02-20 16:49:20,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158365425] [2022-02-20 16:49:20,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-02-20 16:49:20,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:20,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:49:20,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:20,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 16:49:20,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 16:49:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=452, Unknown=2, NotChecked=86, Total=600 [2022-02-20 16:49:20,563 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:49:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:22,901 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-02-20 16:49:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 16:49:22,901 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-02-20 16:49:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:49:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 54 transitions. [2022-02-20 16:49:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:49:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 54 transitions. [2022-02-20 16:49:22,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 54 transitions. [2022-02-20 16:49:22,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:22,979 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:49:22,979 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:49:22,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=1174, Unknown=2, NotChecked=142, Total=1482 [2022-02-20 16:49:22,981 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:22,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 245 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 183 Invalid, 0 Unknown, 71 Unchecked, 0.7s Time] [2022-02-20 16:49:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:49:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-02-20 16:49:22,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:22,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:22,984 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:22,985 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:22,986 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 16:49:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 16:49:22,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:22,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:22,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 16:49:22,987 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 16:49:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:22,988 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 16:49:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-02-20 16:49:22,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:22,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:22,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:22,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-02-20 16:49:22,990 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 47 [2022-02-20 16:49:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:22,990 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-02-20 16:49:22,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 17 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:49:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-02-20 16:49:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 16:49:22,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:22,991 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-02-20 16:49:23,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 16:49:23,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:23,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:23,407 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1123139788, now seen corresponding path program 3 times [2022-02-20 16:49:23,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:23,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142038232] [2022-02-20 16:49:23,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:49:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:23,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:23,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:23,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:49:23,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 16:49:23,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:23,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 16:49:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:23,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:23,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:23,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:24,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:49:24,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:24,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 47 [2022-02-20 16:49:24,240 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 16:49:24,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 29 [2022-02-20 16:49:24,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3266#true} is VALID [2022-02-20 16:49:24,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {3266#true} is VALID [2022-02-20 16:49:24,357 INFO L272 TraceCheckUtils]: 2: Hoare triple {3266#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {3266#true} is VALID [2022-02-20 16:49:24,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:24,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {3266#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:24,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3266#true} {3266#true} #105#return; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} havoc main_#t~ret39#1; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L272 TraceCheckUtils]: 9: Hoare triple {3266#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3266#true} {3266#true} #107#return; {3266#true} is VALID [2022-02-20 16:49:24,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} havoc main_#t~ret40#1; {3266#true} is VALID [2022-02-20 16:49:24,359 INFO L272 TraceCheckUtils]: 16: Hoare triple {3266#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {3266#true} is VALID [2022-02-20 16:49:24,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3322#(= (_ bv0 32) insert_list_~l.offset)} is VALID [2022-02-20 16:49:24,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {3322#(= (_ bv0 32) insert_list_~l.offset)} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3322#(= (_ bv0 32) insert_list_~l.offset)} is VALID [2022-02-20 16:49:24,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {3322#(= (_ bv0 32) insert_list_~l.offset)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3329#(= ~head~0.offset (_ bv0 32))} is VALID [2022-02-20 16:49:24,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {3329#(= ~head~0.offset (_ bv0 32))} assume true; {3329#(= ~head~0.offset (_ bv0 32))} is VALID [2022-02-20 16:49:24,361 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3329#(= ~head~0.offset (_ bv0 32))} {3266#true} #109#return; {3329#(= ~head~0.offset (_ bv0 32))} is VALID [2022-02-20 16:49:24,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {3329#(= ~head~0.offset (_ bv0 32))} havoc main_#t~ret41#1; {3329#(= ~head~0.offset (_ bv0 32))} is VALID [2022-02-20 16:49:24,362 INFO L272 TraceCheckUtils]: 23: Hoare triple {3329#(= ~head~0.offset (_ bv0 32))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {3342#(= |old(~head~0.offset)| ~head~0.offset)} is VALID [2022-02-20 16:49:24,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#(= |old(~head~0.offset)| ~head~0.offset)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3346#(and (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:24,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {3346#(and (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3350#(and (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:24,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {3350#(and (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3354#(and (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {3354#(and (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)))} assume true; {3354#(and (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,365 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3354#(and (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)))} {3329#(= ~head~0.offset (_ bv0 32))} #111#return; {3361#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {3361#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {3365#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset))} is VALID [2022-02-20 16:49:24,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {3365#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3369#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))} is VALID [2022-02-20 16:49:24,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {3369#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3373#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) |ULTIMATE.start_main_~mylist~0#1.base|) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {3373#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) |ULTIMATE.start_main_~mylist~0#1.base|) (= ~head~0.offset (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3377#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {3377#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)))) (= ~head~0.offset (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {3377#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:24,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {3377#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)))) (= ~head~0.offset (_ bv0 32)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} is VALID [2022-02-20 16:49:24,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} is VALID [2022-02-20 16:49:24,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} is VALID [2022-02-20 16:49:24,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} is VALID [2022-02-20 16:49:24,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} is VALID [2022-02-20 16:49:24,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} is VALID [2022-02-20 16:49:24,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {3394#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_20| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= |ULTIMATE.start_search_list_~l#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_20|) (_ bv4 32)))) (_ bv0 32))))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3404#(or (not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32))) (not (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|)))} is VALID [2022-02-20 16:49:24,378 INFO L290 TraceCheckUtils]: 41: Hoare triple {3404#(or (not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32))) (not (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3408#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:24,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {3408#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {3267#false} is VALID [2022-02-20 16:49:24,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {3267#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {3267#false} is VALID [2022-02-20 16:49:24,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {3267#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {3267#false} is VALID [2022-02-20 16:49:24,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {3267#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3267#false} is VALID [2022-02-20 16:49:24,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {3267#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {3267#false} is VALID [2022-02-20 16:49:24,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-02-20 16:49:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:49:24,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:24,989 INFO L290 TraceCheckUtils]: 47: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-02-20 16:49:24,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {3267#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {3267#false} is VALID [2022-02-20 16:49:24,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {3267#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3267#false} is VALID [2022-02-20 16:49:24,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {3267#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {3267#false} is VALID [2022-02-20 16:49:24,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {3267#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {3267#false} is VALID [2022-02-20 16:49:24,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {3408#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {3267#false} is VALID [2022-02-20 16:49:24,990 INFO L290 TraceCheckUtils]: 41: Hoare triple {3404#(or (not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32))) (not (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3408#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:24,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3404#(or (not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32))) (not (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|)))} is VALID [2022-02-20 16:49:24,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3448#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {3468#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {3458#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {3468#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {3468#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {3475#(or (and (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3468#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {3479#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3475#(or (and (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {3483#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3479#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))))} is VALID [2022-02-20 16:49:24,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {3483#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~mylist~0#1.offset|)))))))} is VALID [2022-02-20 16:49:24,999 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3266#true} {3266#true} #111#return; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L272 TraceCheckUtils]: 23: Hoare triple {3266#true} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {3266#true} havoc main_#t~ret41#1; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3266#true} {3266#true} #109#return; {3266#true} is VALID [2022-02-20 16:49:25,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L272 TraceCheckUtils]: 16: Hoare triple {3266#true} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} havoc main_#t~ret40#1; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3266#true} {3266#true} #107#return; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:25,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L272 TraceCheckUtils]: 9: Hoare triple {3266#true} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} havoc main_#t~ret39#1; {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3266#true} {3266#true} #105#return; {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {3266#true} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3266#true} is VALID [2022-02-20 16:49:25,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {3266#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3266#true} is VALID [2022-02-20 16:49:25,003 INFO L272 TraceCheckUtils]: 2: Hoare triple {3266#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {3266#true} is VALID [2022-02-20 16:49:25,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {3266#true} is VALID [2022-02-20 16:49:25,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3266#true} is VALID [2022-02-20 16:49:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 16:49:25,003 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:25,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142038232] [2022-02-20 16:49:25,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142038232] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:49:25,004 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:25,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 23 [2022-02-20 16:49:25,004 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380657746] [2022-02-20 16:49:25,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-02-20 16:49:25,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:25,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:25,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:25,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 16:49:25,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 16:49:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-02-20 16:49:25,085 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:27,741 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 16:49:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 16:49:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-02-20 16:49:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-02-20 16:49:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-02-20 16:49:27,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2022-02-20 16:49:27,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:27,812 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:49:27,812 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:49:27,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-02-20 16:49:27,813 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:27,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 183 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 303 Invalid, 0 Unknown, 3 Unchecked, 1.0s Time] [2022-02-20 16:49:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:49:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-02-20 16:49:27,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:27,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:27,817 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:27,817 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:27,818 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 16:49:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 16:49:27,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:27,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:27,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:49:27,819 INFO L87 Difference]: Start difference. First operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-20 16:49:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:27,820 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 16:49:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 16:49:27,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:27,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:27,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:27,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:27,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-02-20 16:49:27,822 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 48 [2022-02-20 16:49:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:27,822 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-02-20 16:49:27,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 21 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 16:49:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-02-20 16:49:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 16:49:27,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:27,823 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2022-02-20 16:49:27,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:28,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:28,034 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 361857145, now seen corresponding path program 4 times [2022-02-20 16:49:28,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:28,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722795616] [2022-02-20 16:49:28,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:49:28,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:28,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:28,035 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:28,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:49:28,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:49:28,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 16:49:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:28,461 INFO L390 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 [2022-02-20 16:49:28,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:28,681 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:28,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 16:49:28,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:28,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-02-20 16:49:28,862 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-02-20 16:49:28,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 16:49:29,034 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:29,043 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:29,242 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-02-20 16:49:29,242 INFO L390 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 63 [2022-02-20 16:49:29,264 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-02-20 16:49:29,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-02-20 16:49:29,275 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 16:49:29,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2022-02-20 16:49:29,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 35 treesize of output 31 [2022-02-20 16:49:29,831 INFO L356 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-02-20 16:49:29,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 93 [2022-02-20 16:49:30,052 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-02-20 16:49:30,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 76 [2022-02-20 16:49:30,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {3805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3805#true} is VALID [2022-02-20 16:49:30,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {3805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {3805#true} is VALID [2022-02-20 16:49:30,318 INFO L272 TraceCheckUtils]: 2: Hoare triple {3805#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {3805#true} is VALID [2022-02-20 16:49:30,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {3805#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3819#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:30,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {3819#(not (= insert_list_~l.base (_ bv0 32)))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3819#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:30,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {3819#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:30,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} assume true; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:30,321 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3826#(not (= (_ bv0 32) ~head~0.base))} {3805#true} #105#return; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:30,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret39#1; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:30,321 INFO L272 TraceCheckUtils]: 9: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {3839#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:30,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3843#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:30,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {3843#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3847#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:30,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {3847#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:30,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:30,326 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {3826#(not (= (_ bv0 32) ~head~0.base))} #107#return; {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret40#1; {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,327 INFO L272 TraceCheckUtils]: 16: Hoare triple {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {3865#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:30,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {3865#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3869#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:30,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3873#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (not (= insert_list_~l.base (_ bv0 32))) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:30,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {3873#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (not (= insert_list_~l.base (_ bv0 32))) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3877#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {3877#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (= ~head~0.offset (_ bv0 32)))} assume true; {3877#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,337 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3877#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_5) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_5 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (= ~head~0.offset (_ bv0 32)))} {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} #109#return; {3884#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {3884#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret41#1; {3884#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,338 INFO L272 TraceCheckUtils]: 23: Hoare triple {3884#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {3891#(and (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:30,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {3891#(and (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3895#(and (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:30,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {3895#(and (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3899#(and (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_6) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_6 (bvadd (_ bv4 32) insert_list_~l.offset))))) (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) insert_list_~l.offset))))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:30,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {3899#(and (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_6) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_6 (bvadd (_ bv4 32) insert_list_~l.offset))))) (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) insert_list_~l.offset))))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3903#(and (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_6) |#memory_$Pointer$.offset|))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:30,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {3903#(and (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_6) |#memory_$Pointer$.offset|))) (= ~head~0.offset (_ bv0 32)))} assume true; {3903#(and (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_6) |#memory_$Pointer$.offset|))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:31,691 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {3903#(and (exists ((v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_7) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_7 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_6 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_6) |#memory_$Pointer$.offset|))) (= ~head~0.offset (_ bv0 32)))} {3884#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)))} #111#return; {3910#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))))) (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= v_arrayElimCell_24 (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)))} is UNKNOWN [2022-02-20 16:49:31,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {3910#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))))) (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= v_arrayElimCell_24 (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {3914#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) v_arrayElimCell_24)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32)))))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))))) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:49:31,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {3914#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) v_arrayElimCell_24)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32)))))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))))) (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~mylist~0#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3918#(exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_44| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (or (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) v_arrayElimCell_24))))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32)))))} is VALID [2022-02-20 16:49:31,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {3918#(exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_44| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (or (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) v_arrayElimCell_24))))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |ULTIMATE.start_main_~mylist~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32)))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3922#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_44| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))))) (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) v_arrayElimCell_24)))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_44|))))))} is VALID [2022-02-20 16:49:31,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {3922#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~mylist~0#1.base_44| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (_ bv0 32))) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32))) (_ bv4 32))))) (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_arrayElimCell_24) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) v_arrayElimCell_24)))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~mylist~0#1.base_44|) (_ bv4 32)) |v_ULTIMATE.start_main_~mylist~0#1.base_44|))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {3926#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:31,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {3926#(not (= |ULTIMATE.start_main_~mylist~0#1.base| (_ bv0 32)))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {3806#false} is VALID [2022-02-20 16:49:31,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {3806#false} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {3806#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {3806#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {3806#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {3806#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {3806#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {3806#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 41: Hoare triple {3806#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {3806#false} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {3806#false} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {3806#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {3806#false} assume !search_list_#t~short32#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {3806#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {3806#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {3806#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {3806#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {3806#false} is VALID [2022-02-20 16:49:31,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {3806#false} assume !false; {3806#false} is VALID [2022-02-20 16:49:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 16:49:31,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:32,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:32,233 INFO L390 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 1 case distinctions, treesize of input 40 treesize of output 41 [2022-02-20 16:49:32,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:32,242 INFO L390 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 1 case distinctions, treesize of input 34 treesize of output 38 [2022-02-20 16:49:32,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_117 (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= c_~head~0.offset (select v_arrayElimArr_9 (_ bv4 32)))) (not (= (select v_arrayElimArr_8 (_ bv4 32)) c_~head~0.base)) (not (= (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_~head~0.base_117 v_arrayElimArr_8))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_117 v_arrayElimArr_9) c_~head~0.base) .cse1)))) (_ bv0 32))))) is different from false [2022-02-20 16:49:32,286 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:32,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722795616] [2022-02-20 16:49:32,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722795616] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:32,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461662418] [2022-02-20 16:49:32,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:49:32,286 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:32,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:49:32,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 16:49:32,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-02-20 16:49:32,701 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:49:32,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:32,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-20 16:49:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:32,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:32,791 INFO L390 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 [2022-02-20 16:49:32,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:32,966 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:32,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:33,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:33,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-02-20 16:49:33,228 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-02-20 16:49:33,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-02-20 16:49:33,532 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:33,542 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:33,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:33,811 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-02-20 16:49:33,812 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-02-20 16:49:33,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:33,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-02-20 16:49:33,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:33,831 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-02-20 16:49:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-02-20 16:49:34,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:34,782 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 16:49:34,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 49 [2022-02-20 16:49:34,956 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-02-20 16:49:34,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2022-02-20 16:49:35,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {3805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3805#true} is VALID [2022-02-20 16:49:35,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {3805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {3805#true} is VALID [2022-02-20 16:49:35,102 INFO L272 TraceCheckUtils]: 2: Hoare triple {3805#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {3805#true} is VALID [2022-02-20 16:49:35,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {3805#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3819#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:35,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {3819#(not (= insert_list_~l.base (_ bv0 32)))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3819#(not (= insert_list_~l.base (_ bv0 32)))} is VALID [2022-02-20 16:49:35,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {3819#(not (= insert_list_~l.base (_ bv0 32)))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:35,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} assume true; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:35,116 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3826#(not (= (_ bv0 32) ~head~0.base))} {3805#true} #105#return; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:35,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} havoc main_#t~ret39#1; {3826#(not (= (_ bv0 32) ~head~0.base))} is VALID [2022-02-20 16:49:35,117 INFO L272 TraceCheckUtils]: 9: Hoare triple {3826#(not (= (_ bv0 32) ~head~0.base))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {3839#(= |old(~head~0.base)| ~head~0.base)} is VALID [2022-02-20 16:49:35,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {3843#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:35,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {3843#(and (= |old(~head~0.base)| ~head~0.base) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {3847#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:35,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {3847#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:35,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} assume true; {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:35,122 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3851#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))} {3826#(not (= (_ bv0 32) ~head~0.base))} #107#return; {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:35,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret40#1; {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:35,123 INFO L272 TraceCheckUtils]: 16: Hoare triple {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {3865#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:35,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {3865#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4106#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:35,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {4106#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4110#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:35,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {4110#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4114#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:35,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {4114#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} assume true; {4114#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} is VALID [2022-02-20 16:49:35,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4114#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_10 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_10) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_10 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))))} {3858#(and (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= ~head~0.offset (_ bv0 32)))} #109#return; {4121#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:35,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {4121#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} havoc main_#t~ret41#1; {4121#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:35,135 INFO L272 TraceCheckUtils]: 23: Hoare triple {4121#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {4128#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:35,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {4128#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4132#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:35,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {4132#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4136#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_12) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_11)))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:35,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {4136#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_12) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_11)))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4140#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_11)) (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_12) |#memory_$Pointer$.base|))))} is VALID [2022-02-20 16:49:35,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {4140#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_11)) (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_12) |#memory_$Pointer$.base|))))} assume true; {4140#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_11)) (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_12) |#memory_$Pointer$.base|))))} is VALID [2022-02-20 16:49:35,149 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4140#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_11)) (= |old(~head~0.offset)| (select v_arrayElimArr_11 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_12 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_12) |#memory_$Pointer$.base|))))} {4121#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} #111#return; {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {4151#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {4151#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4155#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {4155#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} is VALID [2022-02-20 16:49:35,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {4147#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)))))))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {4168#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} is VALID [2022-02-20 16:49:35,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} is VALID [2022-02-20 16:49:35,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} is VALID [2022-02-20 16:49:35,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {4178#(exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (_ bv0 32)) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:35,173 INFO L290 TraceCheckUtils]: 43: Hoare triple {4188#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_29| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (not (= |v_ULTIMATE.start_search_list_~l#1.base_29| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32)))) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_29|) (_ bv4 32))) (_ bv4 32))))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4198#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {4198#(not (= |ULTIMATE.start_search_list_~l#1.base| (_ bv0 32)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4202#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {4202#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1; {4202#|ULTIMATE.start_search_list_#t~short32#1|} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {4202#|ULTIMATE.start_search_list_#t~short32#1|} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {3806#false} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {3806#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {3806#false} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {3806#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3806#false} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {3806#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {3806#false} is VALID [2022-02-20 16:49:35,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {3806#false} assume !false; {3806#false} is VALID [2022-02-20 16:49:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:35,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:35,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:35,806 INFO L390 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 1 case distinctions, treesize of input 40 treesize of output 41 [2022-02-20 16:49:35,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:35,813 INFO L390 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 1 case distinctions, treesize of input 34 treesize of output 38 [2022-02-20 16:49:35,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_125 (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_13 (_ bv4 32)) c_~head~0.base)) (not (= (bvneg (select |c_#valid| v_~head~0.base_125)) (_ bv0 1))) (not (= c_~head~0.offset (select v_arrayElimArr_14 (_ bv4 32)))) (not (= (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_~head~0.base_125 v_arrayElimArr_13))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_125 v_arrayElimArr_14) c_~head~0.base) .cse1)))) (_ bv0 32))))) is different from false [2022-02-20 16:49:35,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461662418] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:35,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:35,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 39 [2022-02-20 16:49:35,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434584723] [2022-02-20 16:49:35,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-02-20 16:49:35,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:35,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:49:35,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:35,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-20 16:49:35,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-20 16:49:35,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1920, Unknown=27, NotChecked=178, Total=2256 [2022-02-20 16:49:35,981 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:49:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:41,946 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-02-20 16:49:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 16:49:41,946 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-02-20 16:49:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:49:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:49:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-02-20 16:49:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:49:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 70 transitions. [2022-02-20 16:49:41,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 70 transitions. [2022-02-20 16:49:42,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:42,085 INFO L225 Difference]: With dead ends: 73 [2022-02-20 16:49:42,085 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:49:42,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=327, Invalid=4185, Unknown=52, NotChecked=266, Total=4830 [2022-02-20 16:49:42,087 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:49:42,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 369 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 353 Invalid, 0 Unknown, 250 Unchecked, 1.6s Time] [2022-02-20 16:49:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:49:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2022-02-20 16:49:42,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:49:42,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:42,092 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:42,092 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:42,093 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-02-20 16:49:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-02-20 16:49:42,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:42,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:42,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-02-20 16:49:42,094 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-02-20 16:49:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:49:42,095 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-02-20 16:49:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-02-20 16:49:42,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:49:42,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:49:42,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:49:42,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:49:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:49:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-20 16:49:42,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 51 [2022-02-20 16:49:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:49:42,097 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-20 16:49:42,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:49:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 16:49:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-20 16:49:42,098 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:49:42,098 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:49:42,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:42,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:49:42,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:49:42,505 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:49:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:49:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1042924030, now seen corresponding path program 5 times [2022-02-20 16:49:42,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:49:42,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558493275] [2022-02-20 16:49:42,506 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 16:49:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:49:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:49:42,507 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:49:42,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 16:49:42,998 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-02-20 16:49:42,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:43,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 111 conjunts are in the unsatisfiable core [2022-02-20 16:49:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:43,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:43,061 INFO L390 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 [2022-02-20 16:49:43,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:43,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2022-02-20 16:49:43,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 16:49:43,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2022-02-20 16:49:43,539 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-02-20 16:49:43,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2022-02-20 16:49:43,594 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-02-20 16:49:43,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-02-20 16:49:43,926 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:43,933 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:44,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 70 [2022-02-20 16:49:44,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41 [2022-02-20 16:49:44,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,231 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-02-20 16:49:44,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 64 [2022-02-20 16:49:44,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 16:49:44,611 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:44,619 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,911 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-02-20 16:49:44,911 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 114 [2022-02-20 16:49:44,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-02-20 16:49:44,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 45 [2022-02-20 16:49:44,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:44,974 INFO L356 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2022-02-20 16:49:44,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 38 [2022-02-20 16:49:47,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:49:47,427 INFO L356 Elim1Store]: treesize reduction 133, result has 18.9 percent of original size [2022-02-20 16:49:47,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 154 [2022-02-20 16:49:47,571 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-02-20 16:49:47,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-02-20 16:49:47,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:47,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 38 [2022-02-20 16:49:47,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {4608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4608#true} is VALID [2022-02-20 16:49:47,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {4608#true} is VALID [2022-02-20 16:49:47,819 INFO L272 TraceCheckUtils]: 2: Hoare triple {4608#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {4608#true} is VALID [2022-02-20 16:49:47,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {4608#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4622#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= |insert_list_#in~k| insert_list_~k) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:47,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {4622#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= |insert_list_#in~k| insert_list_~k) (= (_ bv0 32) insert_list_~l.offset))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4626#(and (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv2 32) insert_list_~l.offset))) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset) ((_ extract 7 0) |insert_list_#in~k|)) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv3 32) insert_list_~l.offset))) (= (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv1 32) insert_list_~l.offset)) ((_ extract 15 8) |insert_list_#in~k|)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:47,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#(and (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv2 32) insert_list_~l.offset))) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset) ((_ extract 7 0) |insert_list_#in~k|)) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv3 32) insert_list_~l.offset))) (= (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv1 32) insert_list_~l.offset)) ((_ extract 15 8) |insert_list_#in~k|)) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} is VALID [2022-02-20 16:49:47,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} assume true; {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} is VALID [2022-02-20 16:49:47,826 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} {4608#true} #105#return; {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:47,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret39#1; {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:47,827 INFO L272 TraceCheckUtils]: 9: Hoare triple {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {4644#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-20 16:49:47,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {4644#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4648#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:47,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {4648#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4652#(and (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1251) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:47,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4652#(and (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1251) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4656#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1251))))} is VALID [2022-02-20 16:49:47,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1251))))} assume true; {4656#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1251))))} is VALID [2022-02-20 16:49:47,834 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4656#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (_ bv0 32) ~head~0.base)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1251))))} {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} #107#return; {4663#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| ~head~0.base)) (_ bv1 1))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:47,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {4663#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| ~head~0.base)) (_ bv1 1))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} havoc main_#t~ret40#1; {4663#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| ~head~0.base)) (_ bv1 1))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:47,836 INFO L272 TraceCheckUtils]: 16: Hoare triple {4663#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| ~head~0.base)) (_ bv1 1))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:47,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4674#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:47,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {4674#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= insert_list_~l.base (_ bv0 32))) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4678#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_15 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_15) |#memory_$Pointer$.offset|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) insert_list_~l.offset))))) (not (= insert_list_~l.base (_ bv0 32))) (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1260))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:47,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {4678#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_15 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_15) |#memory_$Pointer$.offset|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) insert_list_~l.offset))))) (not (= insert_list_~l.base (_ bv0 32))) (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1260))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4682#(and (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1260) |#memory_int|)) (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_15) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_15 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) ~head~0.offset))))))} is VALID [2022-02-20 16:49:47,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {4682#(and (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1260) |#memory_int|)) (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_15) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_15 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) ~head~0.offset))))))} assume true; {4682#(and (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1260) |#memory_int|)) (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_15) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_15 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) ~head~0.offset))))))} is VALID [2022-02-20 16:49:47,854 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4682#(and (exists ((v_ArrVal_1260 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1260) |#memory_int|)) (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (not (= (_ bv0 32) ~head~0.base)) (exists ((v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_15) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_15 (bvadd (_ bv4 32) ~head~0.offset))))) (= ~head~0.offset (_ bv0 32)) (exists ((v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_16) |#memory_$Pointer$.base|) (= |old(~head~0.base)| (select v_arrayElimArr_16 (bvadd (_ bv4 32) ~head~0.offset))))))} {4663#(and (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| ~head~0.base)) (_ bv1 1))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} #109#return; {4689#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)) (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 16:49:47,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {4689#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)) (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv1 1)) (_ bv0 1)))} havoc main_#t~ret41#1; {4689#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)) (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 16:49:47,860 INFO L272 TraceCheckUtils]: 23: Hoare triple {4689#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)) (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv1 1)) (_ bv0 1)))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:47,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4699#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:47,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {4699#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4703#(and (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1264) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_18)))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:47,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {4703#(and (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1264) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_18)))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} is VALID [2022-02-20 16:49:47,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} assume true; {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} is VALID [2022-02-20 16:49:47,894 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} {4689#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (not (= (_ bv0 32) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)) (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv1 1)) (_ bv0 1)))} #111#return; {4714#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {4714#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {4718#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {4718#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4722#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {4722#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4726#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) |ULTIMATE.start_main_~mylist~0#1.base|) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {4726#(and (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) |ULTIMATE.start_main_~mylist~0#1.base|) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4730#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))))) |ULTIMATE.start_main_~mylist~0#1.base|))} is VALID [2022-02-20 16:49:47,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {4730#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))))) |ULTIMATE.start_main_~mylist~0#1.base|))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4734#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))))))} is VALID [2022-02-20 16:49:47,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {4734#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))))))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {4738#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))))))) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {4738#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))))))) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {4742#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))))))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} is VALID [2022-02-20 16:49:47,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} is VALID [2022-02-20 16:49:47,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} is VALID [2022-02-20 16:49:47,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {4752#(and (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:47,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:47,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:47,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_36| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv3 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)))))))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32)) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_36|) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4779#(not |ULTIMATE.start_search_list_#t~short32#1|)} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {4779#(not |ULTIMATE.start_search_list_#t~short32#1|)} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4609#false} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {4609#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4609#false} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {4609#false} assume !search_list_#t~short32#1; {4609#false} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {4609#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {4609#false} is VALID [2022-02-20 16:49:47,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {4609#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {4609#false} is VALID [2022-02-20 16:49:47,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {4609#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4609#false} is VALID [2022-02-20 16:49:47,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {4609#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {4609#false} is VALID [2022-02-20 16:49:47,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {4609#false} assume !false; {4609#false} is VALID [2022-02-20 16:49:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:49:47,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:50,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:50,328 INFO L390 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 1 case distinctions, treesize of input 420 treesize of output 378 [2022-02-20 16:49:50,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:50,337 INFO L390 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 1 case distinctions, treesize of input 372 treesize of output 333 [2022-02-20 16:49:50,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_133 (_ BitVec 32)) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1280 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_~head~0.base_133 v_arrayElimArr_20)) (.cse3 (store |c_#memory_$Pointer$.base| v_~head~0.base_133 v_arrayElimArr_19)) (.cse7 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse3 c_~head~0.base) .cse7)) (.cse6 (bvadd (_ bv4 32) (select (select .cse4 c_~head~0.base) .cse7)))) (let ((.cse2 (select (select .cse3 .cse5) .cse6)) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (not (= (select v_arrayElimArr_19 (_ bv4 32)) c_~head~0.base)) (= (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_133 v_ArrVal_1280) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd .cse1 (_ bv1 32)))) (select .cse0 .cse1))) (_ bv2 32)) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_133))))) (not (= (select (select .cse3 .cse2) (bvadd (_ bv4 32) .cse1)) (_ bv0 32))) (not (= c_~head~0.offset (select v_arrayElimArr_20 (_ bv4 32))))))))) is different from false [2022-02-20 16:49:50,457 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:49:50,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558493275] [2022-02-20 16:49:50,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558493275] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:50,457 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [434380852] [2022-02-20 16:49:50,457 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 16:49:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:49:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:49:50,459 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 16:49:50,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-02-20 16:49:51,307 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-02-20 16:49:51,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:49:51,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 105 conjunts are in the unsatisfiable core [2022-02-20 16:49:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:49:51,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:49:51,374 INFO L390 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 [2022-02-20 16:49:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:51,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2022-02-20 16:49:51,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:51,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 16:49:52,050 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-02-20 16:49:52,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2022-02-20 16:49:52,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2022-02-20 16:49:52,437 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:52,444 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:52,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:52,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 70 [2022-02-20 16:49:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:52,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 16:49:52,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:52,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 41 [2022-02-20 16:49:52,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:52,947 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-02-20 16:49:52,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 61 [2022-02-20 16:49:53,307 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:53,315 INFO L390 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 11 treesize of output 14 [2022-02-20 16:49:53,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,505 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-02-20 16:49:53,505 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 235 treesize of output 129 [2022-02-20 16:49:53,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 51 [2022-02-20 16:49:53,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,536 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2022-02-20 16:49:53,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:49:53,561 INFO L356 Elim1Store]: treesize reduction 4, result has 86.7 percent of original size [2022-02-20 16:49:53,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2022-02-20 16:49:55,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:49:55,905 INFO L356 Elim1Store]: treesize reduction 47, result has 25.4 percent of original size [2022-02-20 16:49:55,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 297 treesize of output 119 [2022-02-20 16:49:56,003 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 16:49:56,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-02-20 16:49:56,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:56,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 38 [2022-02-20 16:49:56,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {4608#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4608#true} is VALID [2022-02-20 16:49:56,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~ret42#1, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~ret44#1.base, main_#t~ret44#1.offset, main_#t~mem45#1, main_#t~ret46#1, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_~i~0#1, main_~mylist~0#1.base, main_~mylist~0#1.offset, main_~temp~0#1.base, main_~temp~0#1.offset;havoc main_~i~0#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := 0bv32, 0bv32;havoc main_~temp~0#1.base, main_~temp~0#1.offset; {4608#true} is VALID [2022-02-20 16:49:56,137 INFO L272 TraceCheckUtils]: 2: Hoare triple {4608#true} call main_#t~ret39#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32); {4608#true} is VALID [2022-02-20 16:49:56,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {4608#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4622#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= |insert_list_#in~k| insert_list_~k) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:56,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {4622#(and (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= |insert_list_#in~k| insert_list_~k) (= (_ bv0 32) insert_list_~l.offset))} assume ~head~0.base == 0bv32 && ~head~0.offset == 0bv32;call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4626#(and (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv2 32) insert_list_~l.offset))) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset) ((_ extract 7 0) |insert_list_#in~k|)) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv3 32) insert_list_~l.offset))) (= (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv1 32) insert_list_~l.offset)) ((_ extract 15 8) |insert_list_#in~k|)) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:56,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#(and (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv2 32) insert_list_~l.offset))) (= (select |#valid| insert_list_~l.base) (_ bv1 1)) (= (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset) ((_ extract 7 0) |insert_list_#in~k|)) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv3 32) insert_list_~l.offset))) (= (select (select |#memory_int| insert_list_~l.base) (bvadd (_ bv1 32) insert_list_~l.offset)) ((_ extract 15 8) |insert_list_#in~k|)) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} is VALID [2022-02-20 16:49:56,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} assume true; {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} is VALID [2022-02-20 16:49:56,143 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4630#(and (= ((_ extract 15 8) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32)))) (= ((_ extract 23 16) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset))) (= ((_ extract 31 24) |insert_list_#in~k|) (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset))) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) ((_ extract 7 0) |insert_list_#in~k|)))} {4608#true} #105#return; {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:56,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} havoc main_#t~ret39#1; {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} is VALID [2022-02-20 16:49:56,145 INFO L272 TraceCheckUtils]: 9: Hoare triple {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} call main_#t~ret40#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 5bv32); {4644#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-20 16:49:56,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {4644#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4927#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:56,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {4927#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= (_ bv0 32) insert_list_~l.offset))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4931#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1381))) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} is VALID [2022-02-20 16:49:56,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {4931#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= (select (select |#memory_$Pointer$.offset| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.offset)|) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1381))) (= (_ bv0 32) insert_list_~l.offset) (= (select (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4935#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1381) |#memory_int|)))} is VALID [2022-02-20 16:49:56,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {4935#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1381) |#memory_int|)))} assume true; {4935#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1381) |#memory_int|)))} is VALID [2022-02-20 16:49:56,162 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4935#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (exists ((v_ArrVal_1381 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1381) |#memory_int|)))} {4637#(and (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv2 32) ~head~0.offset)) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) ~head~0.offset) (_ bv2 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd ~head~0.offset (_ bv1 32))) (_ bv0 8)) (= (select (select |#memory_int| ~head~0.base) (bvadd (_ bv3 32) ~head~0.offset)) (_ bv0 8)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= ~head~0.offset (_ bv0 32)))} #107#return; {4942#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:56,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {4942#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} havoc main_#t~ret40#1; {4942#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} is VALID [2022-02-20 16:49:56,164 INFO L272 TraceCheckUtils]: 16: Hoare triple {4942#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} call main_#t~ret41#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 1bv32); {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:56,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4952#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:56,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {4952#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4956#(and (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_22) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_22 (bvadd (_ bv4 32) insert_list_~l.offset))))) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1391) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:56,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {4956#(and (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_22) |#memory_$Pointer$.offset|) (= |old(~head~0.offset)| (select v_arrayElimArr_22 (bvadd (_ bv4 32) insert_list_~l.offset))))) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1391) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|))) (= (store |old(#valid)| insert_list_~l.base (_ bv1 1)) |#valid|) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4960#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_22)) (= (select v_arrayElimArr_22 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1391))))} is VALID [2022-02-20 16:49:56,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {4960#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_22)) (= (select v_arrayElimArr_22 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1391))))} assume true; {4960#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_22)) (= (select v_arrayElimArr_22 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1391))))} is VALID [2022-02-20 16:49:56,182 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4960#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (= (store |old(#valid)| ~head~0.base (_ bv1 1)) |#valid|) (exists ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_21) |#memory_$Pointer$.base|) (= (select v_arrayElimArr_21 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|))) (exists ((v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_22)) (= (select v_arrayElimArr_22 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.offset)|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1391 (Array (_ BitVec 32) (_ BitVec 8)))) (= |#memory_int| (store |old(#memory_int)| ~head~0.base v_ArrVal_1391))))} {4942#(and (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 32)) (_ bv0 8)) (= ~head~0.offset (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv3 32))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1))))} #109#return; {4967#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)))} is VALID [2022-02-20 16:49:56,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {4967#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)))} havoc main_#t~ret41#1; {4967#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)))} is VALID [2022-02-20 16:49:56,184 INFO L272 TraceCheckUtils]: 23: Hoare triple {4967#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)))} call main_#t~ret42#1 := insert_list(main_~mylist~0#1.base, main_~mylist~0#1.offset, 3bv32); {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:56,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {4670#(and (= |old(#valid)| |#valid|) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc38.base, #t~malloc38.offset := #Ultimate.allocOnHeap(8bv32);~l.base, ~l.offset := #t~malloc38.base, #t~malloc38.offset;havoc #t~malloc38.base, #t~malloc38.offset; {4699#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:49:56,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {4699#(and (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (= |old(~head~0.base)| ~head~0.base) (= |old(~head~0.offset)| ~head~0.offset) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) insert_list_~l.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(~head~0.base == 0bv32 && ~head~0.offset == 0bv32);call write~intINTTYPE4(~k, ~l.base, ~l.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~bvadd32(4bv32, ~l.offset), 4bv32); {4703#(and (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1264) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_18)))) (= (_ bv0 32) insert_list_~l.offset))} is VALID [2022-02-20 16:49:56,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {4703#(and (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| insert_list_~l.base v_ArrVal_1264) |#memory_int|)) (= (_ bv0 1) (bvneg (select |old(#valid)| insert_list_~l.base))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) insert_list_~l.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| insert_list_~l.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) insert_list_~l.offset))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| insert_list_~l.base v_arrayElimArr_18)))) (= (_ bv0 32) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0bv32; {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} is VALID [2022-02-20 16:49:56,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} assume true; {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} is VALID [2022-02-20 16:49:56,200 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4707#(and (= (bvneg (select |old(#valid)| ~head~0.base)) (_ bv0 1)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| ~head~0.base v_arrayElimArr_18)) (= |old(~head~0.offset)| (select v_arrayElimArr_18 (bvadd (_ bv4 32) ~head~0.offset))))) (exists ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_17 (bvadd (_ bv4 32) ~head~0.offset)) |old(~head~0.base)|) (= (store |old(#memory_$Pointer$.base)| ~head~0.base v_arrayElimArr_17) |#memory_$Pointer$.base|))) (= ~head~0.offset (_ bv0 32)) (exists ((v_ArrVal_1264 (Array (_ BitVec 32) (_ BitVec 8)))) (= (store |old(#memory_int)| ~head~0.base v_ArrVal_1264) |#memory_int|)))} {4967#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select |#valid| ~head~0.base) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) (_ bv0 32)) (= ~head~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv1 1)) (= (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (_ bv4 32))))) (_ bv0 1)))} #111#return; {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} havoc main_#t~ret42#1;main_~mylist~0#1.base, main_~mylist~0#1.offset := ~head~0.base, ~head~0.offset; {4993#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {4993#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| ~head~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4997#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {4997#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume !!(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32);call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~mylist~0#1.base, ~bvadd32(4bv32, main_~mylist~0#1.offset), 4bv32);main_~mylist~0#1.base, main_~mylist~0#1.offset := main_#t~mem43#1.base, main_#t~mem43#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset; {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume !(main_~mylist~0#1.base != 0bv32 || main_~mylist~0#1.offset != 0bv32); {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} is VALID [2022-02-20 16:49:56,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {4989#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) ~head~0.base)) (= (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv3 32))) (= ~head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv0 32)) (_ bv2 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (not (= (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| ~head~0.base) (bvadd (_ bv4 32) ~head~0.offset))))) (_ bv4 32)))))} assume { :begin_inline_search_list } true;search_list_#in~l#1.base, search_list_#in~l#1.offset, search_list_#in~k#1 := main_~mylist~0#1.base, main_~mylist~0#1.offset, 2bv32;havoc search_list_#res#1.base, search_list_#res#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset, search_list_#t~mem31#1, search_list_#t~short32#1, search_list_~l#1.base, search_list_~l#1.offset, search_list_~k#1;search_list_~l#1.base, search_list_~l#1.offset := search_list_#in~l#1.base, search_list_#in~l#1.offset;search_list_~k#1 := search_list_#in~k#1;search_list_~l#1.base, search_list_~l#1.offset := ~head~0.base, ~head~0.offset; {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:56,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:56,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} is VALID [2022-02-20 16:49:56,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {5013#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (not (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_search_list_~l#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_search_list_~l#1.offset|))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:56,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:56,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} is VALID [2022-02-20 16:49:56,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {5023#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) |ULTIMATE.start_search_list_~l#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= |ULTIMATE.start_search_list_~l#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} is VALID [2022-02-20 16:49:56,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} is VALID [2022-02-20 16:49:56,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} is VALID [2022-02-20 16:49:56,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {5033#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_44| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)))) (= (_ bv2 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32)) |v_ULTIMATE.start_search_list_~l#1.base_44|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv2 32)) (_ bv0 8)) (= (_ bv0 8) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv3 32))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))))) (_ bv4 32))) (_ bv1 32)) (_ bv0 8)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32))) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_search_list_~l#1.base_44|) (_ bv4 32)))) |ULTIMATE.start_search_list_~l#1.base|))))} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:56,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} is VALID [2022-02-20 16:49:56,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {4772#(and (= (_ bv2 32) |ULTIMATE.start_search_list_~k#1|) (= (_ bv2 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv0 32))) (= (_ bv0 8) (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv1 32))) (= (_ bv0 32) |ULTIMATE.start_search_list_~l#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv3 32)) (_ bv0 8)) (= (select (select |#memory_int| |ULTIMATE.start_search_list_~l#1.base|) (_ bv2 32)) (_ bv0 8)))} assume search_list_#t~short32#1;call search_list_#t~mem31#1 := read~intINTTYPE4(search_list_~l#1.base, search_list_~l#1.offset, 4bv32);search_list_#t~short32#1 := search_list_#t~mem31#1 != search_list_~k#1; {4779#(not |ULTIMATE.start_search_list_#t~short32#1|)} is VALID [2022-02-20 16:49:56,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {4779#(not |ULTIMATE.start_search_list_#t~short32#1|)} assume !!search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1;call search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset := read~$Pointer$(search_list_~l#1.base, ~bvadd32(4bv32, search_list_~l#1.offset), 4bv32);search_list_~l#1.base, search_list_~l#1.offset := search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset;havoc search_list_#t~mem33#1.base, search_list_#t~mem33#1.offset; {4609#false} is VALID [2022-02-20 16:49:56,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {4609#false} search_list_#t~short32#1 := search_list_~l#1.base != 0bv32 || search_list_~l#1.offset != 0bv32; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {4609#false} assume !search_list_#t~short32#1; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {4609#false} assume !search_list_#t~short32#1;havoc search_list_#t~mem31#1;havoc search_list_#t~short32#1; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {4609#false} search_list_#res#1.base, search_list_#res#1.offset := search_list_~l#1.base, search_list_~l#1.offset; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {4609#false} main_#t~ret44#1.base, main_#t~ret44#1.offset := search_list_#res#1.base, search_list_#res#1.offset;assume { :end_inline_search_list } true;main_~temp~0#1.base, main_~temp~0#1.offset := main_#t~ret44#1.base, main_#t~ret44#1.offset;havoc main_#t~ret44#1.base, main_#t~ret44#1.offset;call main_#t~mem45#1 := read~intINTTYPE4(main_~temp~0#1.base, main_~temp~0#1.offset, 4bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_#t~mem45#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {4609#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {4609#false} is VALID [2022-02-20 16:49:56,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {4609#false} assume !false; {4609#false} is VALID [2022-02-20 16:49:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:49:56,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:49:56,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:56,685 INFO L390 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 1 case distinctions, treesize of input 331 treesize of output 302 [2022-02-20 16:49:56,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:49:56,693 INFO L390 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 1 case distinctions, treesize of input 295 treesize of output 266 [2022-02-20 16:49:56,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_141 (_ BitVec 32)) (v_arrayElimArr_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1410 (Array (_ BitVec 32) (_ BitVec 8)))) (or (not (= c_~head~0.offset (select v_arrayElimArr_26 (_ bv4 32)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_141)))) (not (= c_~head~0.base (select v_arrayElimArr_25 (_ bv4 32)))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| v_~head~0.base_141 v_arrayElimArr_26)) (.cse5 (store |c_#memory_$Pointer$.base| v_~head~0.base_141 v_arrayElimArr_25)) (.cse6 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_~head~0.base) .cse6)) (.cse4 (bvadd (_ bv4 32) (select (select .cse2 c_~head~0.base) .cse6)))) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_141 v_ArrVal_1410) (select (select .cse5 .cse3) .cse4))) (.cse1 (select (select .cse2 .cse3) .cse4))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd (_ bv1 32) .cse1))) (select .cse0 .cse1))))) (_ bv2 32)))) is different from false [2022-02-20 16:49:56,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [434380852] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:49:56,777 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:49:56,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 45 [2022-02-20 16:49:56,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662142470] [2022-02-20 16:49:56,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:49:56,778 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-02-20 16:49:56,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:49:56,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.6) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 16:49:56,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:49:56,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-20 16:49:56,983 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:49:56,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-20 16:49:56,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2825, Unknown=23, NotChecked=218, Total=3306 [2022-02-20 16:49:56,985 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 45 states, 45 states have (on average 1.6) internal successors, (72), 42 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7)