./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:53:16,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:53:16,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:53:16,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:53:16,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:53:16,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:53:16,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:53:16,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:53:16,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:53:16,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:53:16,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:53:16,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:53:16,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:53:16,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:53:16,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:53:16,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:53:16,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:53:16,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:53:16,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:53:16,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:53:16,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:53:16,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:53:16,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:53:16,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:53:16,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:53:16,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:53:16,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:53:16,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:53:16,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:53:16,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:53:16,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:53:16,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:53:16,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:53:16,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:53:16,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:53:16,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:53:16,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:53:16,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:53:16,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:53:16,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:53:16,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:53:16,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:53:16,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:53:16,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:53:16,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:53:16,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:53:16,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:53:16,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:53:16,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:53:16,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:53:16,804 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:53:16,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:53:16,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:53:16,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:53:16,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:53:16,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:53:16,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:53:16,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:53:16,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:53:16,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:53:16,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:53:16,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:53:16,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:53:16,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:16,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:53:16,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:53:16,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:53:16,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:53:16,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:53:16,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:53:16,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:53:16,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:53:16,809 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ad15ea2ee4e38087fdbbd25111673bb935102e85f8e91f44e32009dacc41114 [2022-02-20 21:53:17,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:53:17,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:53:17,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:53:17,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:53:17,043 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:53:17,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-02-20 21:53:17,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c7871d9/51057db35f7948d5bbd4f7d84ac994e4/FLAG88fa84e1a [2022-02-20 21:53:17,770 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:53:17,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-02-20 21:53:17,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c7871d9/51057db35f7948d5bbd4f7d84ac994e4/FLAG88fa84e1a [2022-02-20 21:53:18,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c7871d9/51057db35f7948d5bbd4f7d84ac994e4 [2022-02-20 21:53:18,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:53:18,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:53:18,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:18,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:53:18,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:53:18,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:18" (1/1) ... [2022-02-20 21:53:18,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aeddfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:18, skipping insertion in model container [2022-02-20 21:53:18,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:53:18" (1/1) ... [2022-02-20 21:53:18,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:53:18,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:53:18,845 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/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-02-20 21:53:19,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:19,147 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:53:19,264 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/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i[161556,161569] [2022-02-20 21:53:19,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:53:19,374 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:53:19,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19 WrapperNode [2022-02-20 21:53:19,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:53:19,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:19,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:53:19,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:53:19,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,558 INFO L137 Inliner]: procedures = 125, calls = 327, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1066 [2022-02-20 21:53:19,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:53:19,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:53:19,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:53:19,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:53:19,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:53:19,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:53:19,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:53:19,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:53:19,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (1/1) ... [2022-02-20 21:53:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:53:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:53:19,741 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 21:53:19,760 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 21:53:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:53:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:53:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:53:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:53:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:53:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:53:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-02-20 21:53:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-02-20 21:53:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-02-20 21:53:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-02-20 21:53:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure skb_clone [2022-02-20 21:53:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_clone [2022-02-20 21:53:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:53:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:53:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:53:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:53:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-02-20 21:53:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-02-20 21:53:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:53:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:53:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:53:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-02-20 21:53:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-02-20 21:53:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:53:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:53:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_le16 [2022-02-20 21:53:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_le16 [2022-02-20 21:53:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:53:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:53:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:53:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:53:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure eem_rx_fixup [2022-02-20 21:53:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_rx_fixup [2022-02-20 21:53:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:53:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-02-20 21:53:19,788 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-02-20 21:53:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-02-20 21:53:19,788 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-02-20 21:53:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:53:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:53:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:53:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:53:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:53:19,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:53:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-02-20 21:53:19,790 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-02-20 21:53:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:53:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:53:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:53:19,790 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:53:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:53:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:53:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:53:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:53:19,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:53:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:53:19,792 INFO L130 BoogieDeclarations]: Found specification of procedure eem_tx_fixup [2022-02-20 21:53:19,792 INFO L138 BoogieDeclarations]: Found implementation of procedure eem_tx_fixup [2022-02-20 21:53:20,112 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:53:20,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:53:20,210 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:53:21,813 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:53:21,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:53:21,841 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 21:53:21,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:21 BoogieIcfgContainer [2022-02-20 21:53:21,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:53:21,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:53:21,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:53:21,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:53:21,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:53:18" (1/3) ... [2022-02-20 21:53:21,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfd1686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:21, skipping insertion in model container [2022-02-20 21:53:21,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:53:19" (2/3) ... [2022-02-20 21:53:21,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfd1686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:53:21, skipping insertion in model container [2022-02-20 21:53:21,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:53:21" (3/3) ... [2022-02-20 21:53:21,851 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cdc_eem.ko-entry_point.cil.out.i [2022-02-20 21:53:21,855 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:53:21,856 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:53:21,906 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:53:21,911 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 21:53:21,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:53:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 21:53:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 21:53:21,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:21,944 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:21,945 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2123580828, now seen corresponding path program 1 times [2022-02-20 21:53:21,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:21,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487244119] [2022-02-20 21:53:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:22,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {334#true} is VALID [2022-02-20 21:53:22,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {334#true} is VALID [2022-02-20 21:53:22,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-02-20 21:53:22,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #894#return; {334#true} is VALID [2022-02-20 21:53:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:22,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {334#true} is VALID [2022-02-20 21:53:22,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {334#true} is VALID [2022-02-20 21:53:22,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-02-20 21:53:22,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #896#return; {334#true} is VALID [2022-02-20 21:53:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:53:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:22,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {334#true} is VALID [2022-02-20 21:53:22,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {334#true} is VALID [2022-02-20 21:53:22,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {334#true} is VALID [2022-02-20 21:53:22,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #898#return; {334#true} is VALID [2022-02-20 21:53:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:53:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:22,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {334#true} is VALID [2022-02-20 21:53:22,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {334#true} is VALID [2022-02-20 21:53:22,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {334#true} is VALID [2022-02-20 21:53:22,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #900#return; {334#true} is VALID [2022-02-20 21:53:22,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {334#true} is VALID [2022-02-20 21:53:22,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {334#true} is VALID [2022-02-20 21:53:22,469 INFO L272 TraceCheckUtils]: 2: Hoare triple {334#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:22,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {334#true} is VALID [2022-02-20 21:53:22,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {334#true} is VALID [2022-02-20 21:53:22,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} assume true; {334#true} is VALID [2022-02-20 21:53:22,472 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {334#true} {334#true} #894#return; {334#true} is VALID [2022-02-20 21:53:22,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {334#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {334#true} is VALID [2022-02-20 21:53:22,474 INFO L272 TraceCheckUtils]: 8: Hoare triple {334#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:22,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {334#true} is VALID [2022-02-20 21:53:22,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {334#true} is VALID [2022-02-20 21:53:22,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#true} assume true; {334#true} is VALID [2022-02-20 21:53:22,476 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {334#true} {334#true} #896#return; {334#true} is VALID [2022-02-20 21:53:22,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {334#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {334#true} is VALID [2022-02-20 21:53:22,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {334#true} assume { :end_inline_ldv_set_init } true; {334#true} is VALID [2022-02-20 21:53:22,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#true} assume { :end_inline_ldv_initialize } true; {334#true} is VALID [2022-02-20 21:53:22,479 INFO L272 TraceCheckUtils]: 16: Hoare triple {334#true} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:22,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {334#true} is VALID [2022-02-20 21:53:22,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {334#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {334#true} is VALID [2022-02-20 21:53:22,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {334#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {334#true} is VALID [2022-02-20 21:53:22,480 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {334#true} {334#true} #898#return; {334#true} is VALID [2022-02-20 21:53:22,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {334#true} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {334#true} is VALID [2022-02-20 21:53:22,482 INFO L272 TraceCheckUtils]: 22: Hoare triple {334#true} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:22,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {354#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {334#true} is VALID [2022-02-20 21:53:22,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {334#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {334#true} is VALID [2022-02-20 21:53:22,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {334#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {334#true} is VALID [2022-02-20 21:53:22,483 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {334#true} {334#true} #900#return; {334#true} is VALID [2022-02-20 21:53:22,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {334#true} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch165#1; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch174#1; {352#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:53:22,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {352#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_eem_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_13 } true;ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset;havoc ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset := ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {335#false} is VALID [2022-02-20 21:53:22,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {335#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {335#false} is VALID [2022-02-20 21:53:22,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {335#false} assume { :end_inline_ldv_usb_deregister_13 } true; {335#false} is VALID [2022-02-20 21:53:22,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {335#false} assume { :end_inline_eem_driver_exit } true;~ldv_state_variable_0~0 := 2; {335#false} is VALID [2022-02-20 21:53:22,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {335#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {335#false} is VALID [2022-02-20 21:53:22,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {335#false} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {335#false} is VALID [2022-02-20 21:53:22,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {335#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {335#false} is VALID [2022-02-20 21:53:22,494 INFO L272 TraceCheckUtils]: 40: Hoare triple {335#false} call ldv_error(); {335#false} is VALID [2022-02-20 21:53:22,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-02-20 21:53:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:53:22,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:22,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487244119] [2022-02-20 21:53:22,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487244119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:22,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:22,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:53:22,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791409934] [2022-02-20 21:53:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:22,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-02-20 21:53:22,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:22,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:53:22,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:22,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:53:22,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:53:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:53:22,606 INFO L87 Difference]: Start difference. First operand has 331 states, 260 states have (on average 1.4076923076923078) internal successors, (366), 269 states have internal predecessors, (366), 49 states have call successors, (49), 21 states have call predecessors, (49), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:53:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:29,858 INFO L93 Difference]: Finished difference Result 1152 states and 1717 transitions. [2022-02-20 21:53:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:53:29,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-02-20 21:53:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:53:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1717 transitions. [2022-02-20 21:53:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:53:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1717 transitions. [2022-02-20 21:53:29,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1717 transitions. [2022-02-20 21:53:31,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1717 edges. 1717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:31,550 INFO L225 Difference]: With dead ends: 1152 [2022-02-20 21:53:31,550 INFO L226 Difference]: Without dead ends: 762 [2022-02-20 21:53:31,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:53:31,561 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 960 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:31,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1004 Valid, 1184 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 21:53:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-02-20 21:53:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 553. [2022-02-20 21:53:31,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:31,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-20 21:53:31,640 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-20 21:53:31,641 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-20 21:53:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:31,685 INFO L93 Difference]: Finished difference Result 762 states and 1053 transitions. [2022-02-20 21:53:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1053 transitions. [2022-02-20 21:53:31,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:31,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:31,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 762 states. [2022-02-20 21:53:31,696 INFO L87 Difference]: Start difference. First operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand 762 states. [2022-02-20 21:53:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:31,741 INFO L93 Difference]: Finished difference Result 762 states and 1053 transitions. [2022-02-20 21:53:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1053 transitions. [2022-02-20 21:53:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:31,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:31,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 449 states have (on average 1.3407572383073496) internal successors, (602), 453 states have internal predecessors, (602), 68 states have call successors, (68), 36 states have call predecessors, (68), 35 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-02-20 21:53:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 737 transitions. [2022-02-20 21:53:31,780 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 737 transitions. Word has length 42 [2022-02-20 21:53:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:31,781 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 737 transitions. [2022-02-20 21:53:31,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:53:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 737 transitions. [2022-02-20 21:53:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 21:53:31,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:31,784 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:31,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:53:31,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash 653867414, now seen corresponding path program 1 times [2022-02-20 21:53:31,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:31,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842367790] [2022-02-20 21:53:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:31,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:31,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:31,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:31,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #894#return; {4208#true} is VALID [2022-02-20 21:53:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:32,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:32,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:32,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #896#return; {4208#true} is VALID [2022-02-20 21:53:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:53:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:32,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {4208#true} is VALID [2022-02-20 21:53:32,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {4208#true} is VALID [2022-02-20 21:53:32,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4208#true} is VALID [2022-02-20 21:53:32,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #898#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:53:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:32,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {4208#true} is VALID [2022-02-20 21:53:32,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {4208#true} is VALID [2022-02-20 21:53:32,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4208#true} is VALID [2022-02-20 21:53:32,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #900#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:53:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:32,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:32,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:32,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #908#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {4208#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {4208#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {4208#true} is VALID [2022-02-20 21:53:32,059 INFO L272 TraceCheckUtils]: 2: Hoare triple {4208#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:32,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:32,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:32,060 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4208#true} {4208#true} #894#return; {4208#true} is VALID [2022-02-20 21:53:32,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4208#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {4208#true} is VALID [2022-02-20 21:53:32,061 INFO L272 TraceCheckUtils]: 8: Hoare triple {4208#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:32,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:32,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:32,062 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4208#true} {4208#true} #896#return; {4208#true} is VALID [2022-02-20 21:53:32,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {4208#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {4218#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {4218#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,064 INFO L272 TraceCheckUtils]: 16: Hoare triple {4218#(= ~last_index~0 0)} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:32,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {4208#true} is VALID [2022-02-20 21:53:32,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {4208#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {4208#true} is VALID [2022-02-20 21:53:32,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {4208#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4208#true} is VALID [2022-02-20 21:53:32,065 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #898#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {4218#(= ~last_index~0 0)} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {4218#(= ~last_index~0 0)} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:32,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {4234#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {4208#true} is VALID [2022-02-20 21:53:32,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {4208#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {4208#true} is VALID [2022-02-20 21:53:32,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {4208#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {4208#true} is VALID [2022-02-20 21:53:32,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #900#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {4218#(= ~last_index~0 0)} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {4218#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {4218#(= ~last_index~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {4218#(= ~last_index~0 0)} assume main_#t~switch165#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {4218#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {4218#(= ~last_index~0 0)} assume !main_#t~switch174#1;main_#t~switch174#1 := main_#t~switch174#1 || 1 == main_~tmp___3~2#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {4218#(= ~last_index~0 0)} assume main_#t~switch174#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {4218#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_eem_driver_init } true;havoc eem_driver_init_#res#1;havoc eem_driver_init_#t~ret156#1, eem_driver_init_~tmp~15#1;havoc eem_driver_init_~tmp~15#1;assume { :begin_inline_ldv_usb_register_driver_12 } true;ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 12, 0;havoc ldv_usb_register_driver_12_#res#1;havoc ldv_usb_register_driver_12_#t~ret186#1, ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset, ldv_usb_register_driver_12_~ldv_func_res~0#1, ldv_usb_register_driver_12_~tmp~19#1;ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_12_~ldv_func_res~0#1;havoc ldv_usb_register_driver_12_~tmp~19#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet210#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet210#1 && usb_register_driver_#t~nondet210#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet210#1;havoc usb_register_driver_#t~nondet210#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {4218#(= ~last_index~0 0)} ldv_usb_register_driver_12_#t~ret186#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_12_#t~ret186#1 && ldv_usb_register_driver_12_#t~ret186#1 <= 2147483647;ldv_usb_register_driver_12_~tmp~19#1 := ldv_usb_register_driver_12_#t~ret186#1;havoc ldv_usb_register_driver_12_#t~ret186#1;ldv_usb_register_driver_12_~ldv_func_res~0#1 := ldv_usb_register_driver_12_~tmp~19#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset, ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset;havoc ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,074 INFO L272 TraceCheckUtils]: 36: Hoare triple {4218#(= ~last_index~0 0)} call ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset := ldv_zalloc(1560); {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:32,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {4233#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {4208#true} is VALID [2022-02-20 21:53:32,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {4208#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {4208#true} is VALID [2022-02-20 21:53:32,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {4208#true} assume true; {4208#true} is VALID [2022-02-20 21:53:32,075 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4208#true} {4218#(= ~last_index~0 0)} #908#return; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {4218#(= ~last_index~0 0)} ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset := ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {4218#(= ~last_index~0 0)} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_12_#res#1 := ldv_usb_register_driver_12_~ldv_func_res~0#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {4218#(= ~last_index~0 0)} eem_driver_init_#t~ret156#1 := ldv_usb_register_driver_12_#res#1;assume { :end_inline_ldv_usb_register_driver_12 } true;assume -2147483648 <= eem_driver_init_#t~ret156#1 && eem_driver_init_#t~ret156#1 <= 2147483647;eem_driver_init_~tmp~15#1 := eem_driver_init_#t~ret156#1;havoc eem_driver_init_#t~ret156#1;eem_driver_init_#res#1 := eem_driver_init_~tmp~15#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {4218#(= ~last_index~0 0)} main_#t~ret175#1 := eem_driver_init_#res#1;assume { :end_inline_eem_driver_init } true;assume -2147483648 <= main_#t~ret175#1 && main_#t~ret175#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret175#1;havoc main_#t~ret175#1; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {4218#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_4~0); {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {4218#(= ~last_index~0 0)} assume 0 != ~ldv_retval_4~0;~ldv_state_variable_0~0 := 2; {4218#(= ~last_index~0 0)} is VALID [2022-02-20 21:53:32,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {4218#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {4231#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:53:32,079 INFO L290 TraceCheckUtils]: 48: Hoare triple {4231#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {4232#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1|)} is VALID [2022-02-20 21:53:32,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {4232#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1|)} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {4209#false} is VALID [2022-02-20 21:53:32,080 INFO L272 TraceCheckUtils]: 50: Hoare triple {4209#false} call ldv_error(); {4209#false} is VALID [2022-02-20 21:53:32,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {4209#false} assume !false; {4209#false} is VALID [2022-02-20 21:53:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 21:53:32,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:32,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842367790] [2022-02-20 21:53:32,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842367790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:32,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:32,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:53:32,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622123228] [2022-02-20 21:53:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-02-20 21:53:32,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:32,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:32,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:32,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:53:32,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:53:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:53:32,131 INFO L87 Difference]: Start difference. First operand 553 states and 737 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:39,959 INFO L93 Difference]: Finished difference Result 1497 states and 2083 transitions. [2022-02-20 21:53:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:53:39,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-02-20 21:53:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2022-02-20 21:53:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2022-02-20 21:53:39,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1085 transitions. [2022-02-20 21:53:40,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1085 edges. 1085 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:41,086 INFO L225 Difference]: With dead ends: 1497 [2022-02-20 21:53:41,087 INFO L226 Difference]: Without dead ends: 1488 [2022-02-20 21:53:41,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:53:41,089 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 920 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:41,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 1681 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 21:53:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-02-20 21:53:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1219. [2022-02-20 21:53:41,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:41,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1488 states. Second operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-02-20 21:53:41,161 INFO L74 IsIncluded]: Start isIncluded. First operand 1488 states. Second operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-02-20 21:53:41,164 INFO L87 Difference]: Start difference. First operand 1488 states. Second operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-02-20 21:53:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:41,279 INFO L93 Difference]: Finished difference Result 1488 states and 2072 transitions. [2022-02-20 21:53:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2072 transitions. [2022-02-20 21:53:41,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:41,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:41,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) Second operand 1488 states. [2022-02-20 21:53:41,291 INFO L87 Difference]: Start difference. First operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) Second operand 1488 states. [2022-02-20 21:53:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:41,402 INFO L93 Difference]: Finished difference Result 1488 states and 2072 transitions. [2022-02-20 21:53:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2072 transitions. [2022-02-20 21:53:41,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:41,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:41,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:41,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 998 states have (on average 1.3507014028056112) internal successors, (1348), 1008 states have internal predecessors, (1348), 149 states have call successors, (149), 70 states have call predecessors, (149), 71 states have return successors, (160), 148 states have call predecessors, (160), 148 states have call successors, (160) [2022-02-20 21:53:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1657 transitions. [2022-02-20 21:53:41,509 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1657 transitions. Word has length 52 [2022-02-20 21:53:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:41,511 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1657 transitions. [2022-02-20 21:53:41,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 21:53:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1657 transitions. [2022-02-20 21:53:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-02-20 21:53:41,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:41,520 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:41,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:53:41,521 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2008058537, now seen corresponding path program 1 times [2022-02-20 21:53:41,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:41,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730115335] [2022-02-20 21:53:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:41,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #894#return; {10849#true} is VALID [2022-02-20 21:53:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:41,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #896#return; {10849#true} is VALID [2022-02-20 21:53:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:53:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {10849#true} is VALID [2022-02-20 21:53:41,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:41,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10849#true} is VALID [2022-02-20 21:53:41,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #898#return; {10849#true} is VALID [2022-02-20 21:53:41,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:53:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {10849#true} is VALID [2022-02-20 21:53:41,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:41,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10849#true} is VALID [2022-02-20 21:53:41,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #900#return; {10849#true} is VALID [2022-02-20 21:53:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:53:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 21:53:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:41,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:41,891 INFO L272 TraceCheckUtils]: 1: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:41,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,891 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:41,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:41,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,892 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10849#true} {10849#true} #856#return; {10849#true} is VALID [2022-02-20 21:53:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:53:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #852#return; {10849#true} is VALID [2022-02-20 21:53:41,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:41,911 INFO L272 TraceCheckUtils]: 1: Hoare triple {10849#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:41,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,912 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10849#true} {10849#true} #852#return; {10849#true} is VALID [2022-02-20 21:53:41,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {10849#true} is VALID [2022-02-20 21:53:41,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,912 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10849#true} {10849#true} #860#return; {10849#true} is VALID [2022-02-20 21:53:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 21:53:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {10849#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {10849#true} is VALID [2022-02-20 21:53:41,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10849#true} {10849#true} #862#return; {10849#true} is VALID [2022-02-20 21:53:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:53:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {10849#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:41,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10849#true} {10849#true} #864#return; {10849#true} is VALID [2022-02-20 21:53:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:53:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #850#return; {10849#true} is VALID [2022-02-20 21:53:41,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:41,955 INFO L272 TraceCheckUtils]: 1: Hoare triple {10849#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:41,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,956 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10849#true} {10849#true} #850#return; {10849#true} is VALID [2022-02-20 21:53:41,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {10849#true} is VALID [2022-02-20 21:53:41,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,956 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10849#true} {10849#true} #866#return; {10849#true} is VALID [2022-02-20 21:53:41,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:53:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {10849#true} is VALID [2022-02-20 21:53:41,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10849#true} {10849#true} #868#return; {10849#true} is VALID [2022-02-20 21:53:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:53:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:41,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:41,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:41,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #870#return; {10849#true} is VALID [2022-02-20 21:53:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:53:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {10849#true} is VALID [2022-02-20 21:53:42,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} ~last_index~0 := ~last_index~0 - 1; {10849#true} is VALID [2022-02-20 21:53:42,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,004 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10849#true} {10849#true} #854#return; {10849#true} is VALID [2022-02-20 21:53:42,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {10849#true} is VALID [2022-02-20 21:53:42,005 INFO L272 TraceCheckUtils]: 1: Hoare triple {10849#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {10849#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {10849#true} is VALID [2022-02-20 21:53:42,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {10849#true} ~last_index~0 := ~last_index~0 - 1; {10849#true} is VALID [2022-02-20 21:53:42,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10849#true} {10849#true} #854#return; {10849#true} is VALID [2022-02-20 21:53:42,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,007 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10849#true} {10849#true} #874#return; {10849#true} is VALID [2022-02-20 21:53:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-20 21:53:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,023 INFO L272 TraceCheckUtils]: 1: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:42,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,024 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10849#true} {10849#true} #888#return; {10849#true} is VALID [2022-02-20 21:53:42,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {10974#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {10849#true} is VALID [2022-02-20 21:53:42,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {10849#true} is VALID [2022-02-20 21:53:42,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {10849#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {10849#true} is VALID [2022-02-20 21:53:42,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {10849#true} is VALID [2022-02-20 21:53:42,035 INFO L272 TraceCheckUtils]: 5: Hoare triple {10849#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,036 INFO L272 TraceCheckUtils]: 7: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,037 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:42,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,038 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10849#true} {10849#true} #856#return; {10849#true} is VALID [2022-02-20 21:53:42,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {10849#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {10849#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {10849#true} is VALID [2022-02-20 21:53:42,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {10849#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {10849#true} assume #t~switch130#1; {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {10849#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {10849#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {10849#true} is VALID [2022-02-20 21:53:42,040 INFO L272 TraceCheckUtils]: 24: Hoare triple {10849#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,041 INFO L272 TraceCheckUtils]: 26: Hoare triple {10849#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10849#true} {10849#true} #852#return; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {10849#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,042 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10849#true} {10849#true} #860#return; {10849#true} is VALID [2022-02-20 21:53:42,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {10849#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,043 INFO L272 TraceCheckUtils]: 35: Hoare triple {10849#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {10849#true} is VALID [2022-02-20 21:53:42,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {10849#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {10849#true} is VALID [2022-02-20 21:53:42,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,043 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10849#true} {10849#true} #862#return; {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {10849#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L290 TraceCheckUtils]: 40: Hoare triple {10849#true} assume !(0 != ~tmp___0~4#1); {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L272 TraceCheckUtils]: 41: Hoare triple {10849#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L290 TraceCheckUtils]: 42: Hoare triple {10849#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,044 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10849#true} {10849#true} #864#return; {10849#true} is VALID [2022-02-20 21:53:42,045 INFO L272 TraceCheckUtils]: 45: Hoare triple {10849#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,046 INFO L272 TraceCheckUtils]: 47: Hoare triple {10849#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L290 TraceCheckUtils]: 49: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L290 TraceCheckUtils]: 50: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10849#true} {10849#true} #850#return; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L290 TraceCheckUtils]: 52: Hoare triple {10849#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,047 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10849#true} {10849#true} #866#return; {10849#true} is VALID [2022-02-20 21:53:42,048 INFO L290 TraceCheckUtils]: 55: Hoare triple {10849#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,049 INFO L272 TraceCheckUtils]: 56: Hoare triple {10849#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:42,049 INFO L290 TraceCheckUtils]: 57: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {10849#true} is VALID [2022-02-20 21:53:42,049 INFO L290 TraceCheckUtils]: 58: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,049 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10849#true} {10849#true} #868#return; {10849#true} is VALID [2022-02-20 21:53:42,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {10849#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {10849#true} is VALID [2022-02-20 21:53:42,050 INFO L272 TraceCheckUtils]: 61: Hoare triple {10849#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,051 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {10849#true} {10849#true} #870#return; {10849#true} is VALID [2022-02-20 21:53:42,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {10849#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {10849#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {10849#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {10849#true} is VALID [2022-02-20 21:53:42,052 INFO L272 TraceCheckUtils]: 69: Hoare triple {10849#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {10849#true} is VALID [2022-02-20 21:53:42,053 INFO L272 TraceCheckUtils]: 71: Hoare triple {10849#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 74: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {10849#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 77: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {10849#true} ~last_index~0 := ~last_index~0 - 1; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L290 TraceCheckUtils]: 79: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,054 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10849#true} {10849#true} #854#return; {10849#true} is VALID [2022-02-20 21:53:42,055 INFO L290 TraceCheckUtils]: 81: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,055 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10849#true} {10849#true} #874#return; {10849#true} is VALID [2022-02-20 21:53:42,055 INFO L290 TraceCheckUtils]: 83: Hoare triple {10849#true} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,055 INFO L290 TraceCheckUtils]: 84: Hoare triple {10849#true} assume { :end_inline_eem_linkcmd } true; {10849#true} is VALID [2022-02-20 21:53:42,056 INFO L272 TraceCheckUtils]: 85: Hoare triple {10849#true} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,056 INFO L290 TraceCheckUtils]: 86: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L272 TraceCheckUtils]: 87: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 88: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 93: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {10849#true} {10849#true} #888#return; {10849#true} is VALID [2022-02-20 21:53:42,057 INFO L290 TraceCheckUtils]: 95: Hoare triple {10849#true} havoc #t~ret154#1.base, #t~ret154#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {10849#true} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {10849#true} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,058 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {10849#true} {10850#false} #918#return; {10850#false} is VALID [2022-02-20 21:53:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-02-20 21:53:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:42,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:42,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10849#true} {10850#false} #908#return; {10850#false} is VALID [2022-02-20 21:53:42,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {10849#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {10849#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {10849#true} is VALID [2022-02-20 21:53:42,068 INFO L272 TraceCheckUtils]: 2: Hoare triple {10849#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:42,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,069 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10849#true} {10849#true} #894#return; {10849#true} is VALID [2022-02-20 21:53:42,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {10849#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {10849#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:42,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,070 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10849#true} {10849#true} #896#return; {10849#true} is VALID [2022-02-20 21:53:42,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {10849#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {10849#true} is VALID [2022-02-20 21:53:42,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {10849#true} assume { :end_inline_ldv_set_init } true; {10849#true} is VALID [2022-02-20 21:53:42,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {10849#true} assume { :end_inline_ldv_initialize } true; {10849#true} is VALID [2022-02-20 21:53:42,072 INFO L272 TraceCheckUtils]: 16: Hoare triple {10849#true} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:42,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {10849#true} is VALID [2022-02-20 21:53:42,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {10849#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:42,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {10849#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10849#true} is VALID [2022-02-20 21:53:42,072 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10849#true} {10849#true} #898#return; {10849#true} is VALID [2022-02-20 21:53:42,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {10849#true} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,074 INFO L272 TraceCheckUtils]: 22: Hoare triple {10849#true} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:42,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {10849#true} is VALID [2022-02-20 21:53:42,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {10849#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:42,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {10849#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {10849#true} is VALID [2022-02-20 21:53:42,074 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10849#true} {10849#true} #900#return; {10849#true} is VALID [2022-02-20 21:53:42,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {10849#true} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {10867#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:53:42,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {10867#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {10867#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:53:42,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {10867#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {10867#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:53:42,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {10867#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 2 == main_~tmp___1~3#1; {10867#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:53:42,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {10867#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch165#1; {10867#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:53:42,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {10867#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet176#1 && main_#t~nondet176#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet176#1;havoc main_#t~nondet176#1;main_#t~switch177#1 := 0 == main_~tmp___4~2#1; {10850#false} is VALID [2022-02-20 21:53:42,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {10850#false} assume main_#t~switch177#1; {10850#false} is VALID [2022-02-20 21:53:42,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {10850#false} assume !(1 == ~ldv_state_variable_2~0); {10850#false} is VALID [2022-02-20 21:53:42,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {10850#false} assume 2 == ~ldv_state_variable_2~0; {10850#false} is VALID [2022-02-20 21:53:42,078 INFO L272 TraceCheckUtils]: 36: Hoare triple {10850#false} call main_#t~ret179#1 := eem_rx_fixup(~eem_info_group0~0.base, ~eem_info_group0~0.offset, ~eem_info_group1~0.base, ~eem_info_group1~0.offset); {10974#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {10974#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {10849#true} is VALID [2022-02-20 21:53:42,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {10849#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {10849#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {10849#true} is VALID [2022-02-20 21:53:42,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {10849#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {10849#true} is VALID [2022-02-20 21:53:42,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {10849#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {10849#true} is VALID [2022-02-20 21:53:42,079 INFO L272 TraceCheckUtils]: 42: Hoare triple {10849#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,080 INFO L272 TraceCheckUtils]: 44: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L290 TraceCheckUtils]: 47: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10849#true} {10849#true} #856#return; {10849#true} is VALID [2022-02-20 21:53:42,081 INFO L290 TraceCheckUtils]: 52: Hoare triple {10849#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {10849#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {10849#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {10849#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 56: Hoare triple {10849#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 57: Hoare triple {10849#true} assume #t~switch130#1; {10849#true} is VALID [2022-02-20 21:53:42,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {10849#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {10849#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {10849#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {10849#true} is VALID [2022-02-20 21:53:42,084 INFO L272 TraceCheckUtils]: 61: Hoare triple {10849#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,084 INFO L272 TraceCheckUtils]: 63: Hoare triple {10849#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,085 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10849#true} {10849#true} #852#return; {10849#true} is VALID [2022-02-20 21:53:42,085 INFO L290 TraceCheckUtils]: 68: Hoare triple {10849#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {10849#true} is VALID [2022-02-20 21:53:42,085 INFO L290 TraceCheckUtils]: 69: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10849#true} {10849#true} #860#return; {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L290 TraceCheckUtils]: 71: Hoare triple {10849#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L272 TraceCheckUtils]: 72: Hoare triple {10849#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {10849#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,086 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10849#true} {10849#true} #862#return; {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L290 TraceCheckUtils]: 76: Hoare triple {10849#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {10849#true} assume !(0 != ~tmp___0~4#1); {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L272 TraceCheckUtils]: 78: Hoare triple {10849#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L290 TraceCheckUtils]: 79: Hoare triple {10849#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,087 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10849#true} {10849#true} #864#return; {10849#true} is VALID [2022-02-20 21:53:42,088 INFO L272 TraceCheckUtils]: 82: Hoare triple {10849#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,088 INFO L290 TraceCheckUtils]: 83: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,089 INFO L272 TraceCheckUtils]: 84: Hoare triple {10849#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,089 INFO L290 TraceCheckUtils]: 86: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,089 INFO L290 TraceCheckUtils]: 87: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,089 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10849#true} {10849#true} #850#return; {10849#true} is VALID [2022-02-20 21:53:42,090 INFO L290 TraceCheckUtils]: 89: Hoare triple {10849#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {10849#true} is VALID [2022-02-20 21:53:42,090 INFO L290 TraceCheckUtils]: 90: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,090 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {10849#true} {10849#true} #866#return; {10849#true} is VALID [2022-02-20 21:53:42,090 INFO L290 TraceCheckUtils]: 92: Hoare triple {10849#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,091 INFO L272 TraceCheckUtils]: 93: Hoare triple {10849#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:42,091 INFO L290 TraceCheckUtils]: 94: Hoare triple {10973#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {10849#true} is VALID [2022-02-20 21:53:42,091 INFO L290 TraceCheckUtils]: 95: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,092 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10849#true} {10849#true} #868#return; {10849#true} is VALID [2022-02-20 21:53:42,092 INFO L290 TraceCheckUtils]: 97: Hoare triple {10849#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {10849#true} is VALID [2022-02-20 21:53:42,092 INFO L272 TraceCheckUtils]: 98: Hoare triple {10849#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,092 INFO L290 TraceCheckUtils]: 99: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {10849#true} {10849#true} #870#return; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L290 TraceCheckUtils]: 103: Hoare triple {10849#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {10849#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {10849#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {10849#true} is VALID [2022-02-20 21:53:42,094 INFO L272 TraceCheckUtils]: 106: Hoare triple {10849#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,094 INFO L290 TraceCheckUtils]: 107: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {10849#true} is VALID [2022-02-20 21:53:42,095 INFO L272 TraceCheckUtils]: 108: Hoare triple {10849#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 109: Hoare triple {11050#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {10849#true} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 110: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 111: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 112: Hoare triple {10849#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {10849#true} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 113: Hoare triple {10849#true} assume !false; {10849#true} is VALID [2022-02-20 21:53:42,096 INFO L290 TraceCheckUtils]: 114: Hoare triple {10849#true} assume !(~i~1 < ~last_index~0); {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L290 TraceCheckUtils]: 115: Hoare triple {10849#true} ~last_index~0 := ~last_index~0 - 1; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L290 TraceCheckUtils]: 116: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {10849#true} {10849#true} #854#return; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L290 TraceCheckUtils]: 118: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {10849#true} {10849#true} #874#return; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L290 TraceCheckUtils]: 120: Hoare triple {10849#true} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,097 INFO L290 TraceCheckUtils]: 121: Hoare triple {10849#true} assume { :end_inline_eem_linkcmd } true; {10849#true} is VALID [2022-02-20 21:53:42,098 INFO L272 TraceCheckUtils]: 122: Hoare triple {10849#true} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,098 INFO L290 TraceCheckUtils]: 123: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {10849#true} is VALID [2022-02-20 21:53:42,099 INFO L272 TraceCheckUtils]: 124: Hoare triple {10849#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,099 INFO L290 TraceCheckUtils]: 125: Hoare triple {11037#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {10849#true} is VALID [2022-02-20 21:53:42,099 INFO L290 TraceCheckUtils]: 126: Hoare triple {10849#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,099 INFO L290 TraceCheckUtils]: 127: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {10849#true} {10849#true} #848#return; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L290 TraceCheckUtils]: 129: Hoare triple {10849#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L290 TraceCheckUtils]: 130: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {10849#true} {10849#true} #888#return; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L290 TraceCheckUtils]: 132: Hoare triple {10849#true} havoc #t~ret154#1.base, #t~ret154#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,100 INFO L290 TraceCheckUtils]: 133: Hoare triple {10849#true} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {10849#true} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 134: Hoare triple {10849#true} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {10849#true} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 135: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,101 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {10849#true} {10850#false} #918#return; {10850#false} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 137: Hoare triple {10850#false} assume -2147483648 <= main_#t~ret179#1 && main_#t~ret179#1 <= 2147483647;havoc main_#t~ret179#1;~ldv_state_variable_2~0 := 2; {10850#false} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 138: Hoare triple {10850#false} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {10850#false} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 139: Hoare triple {10850#false} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {10850#false} is VALID [2022-02-20 21:53:42,101 INFO L290 TraceCheckUtils]: 140: Hoare triple {10850#false} assume main_#t~switch165#1; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L290 TraceCheckUtils]: 141: Hoare triple {10850#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L290 TraceCheckUtils]: 142: Hoare triple {10850#false} assume !main_#t~switch174#1;main_#t~switch174#1 := main_#t~switch174#1 || 1 == main_~tmp___3~2#1; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L290 TraceCheckUtils]: 143: Hoare triple {10850#false} assume main_#t~switch174#1; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L290 TraceCheckUtils]: 144: Hoare triple {10850#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_eem_driver_init } true;havoc eem_driver_init_#res#1;havoc eem_driver_init_#t~ret156#1, eem_driver_init_~tmp~15#1;havoc eem_driver_init_~tmp~15#1;assume { :begin_inline_ldv_usb_register_driver_12 } true;ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 12, 0;havoc ldv_usb_register_driver_12_#res#1;havoc ldv_usb_register_driver_12_#t~ret186#1, ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset, ldv_usb_register_driver_12_~ldv_func_res~0#1, ldv_usb_register_driver_12_~tmp~19#1;ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_12_~ldv_func_res~0#1;havoc ldv_usb_register_driver_12_~tmp~19#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet210#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet210#1 && usb_register_driver_#t~nondet210#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet210#1;havoc usb_register_driver_#t~nondet210#1; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L290 TraceCheckUtils]: 145: Hoare triple {10850#false} ldv_usb_register_driver_12_#t~ret186#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_12_#t~ret186#1 && ldv_usb_register_driver_12_#t~ret186#1 <= 2147483647;ldv_usb_register_driver_12_~tmp~19#1 := ldv_usb_register_driver_12_#t~ret186#1;havoc ldv_usb_register_driver_12_#t~ret186#1;ldv_usb_register_driver_12_~ldv_func_res~0#1 := ldv_usb_register_driver_12_~tmp~19#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset, ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset;havoc ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {10850#false} is VALID [2022-02-20 21:53:42,102 INFO L272 TraceCheckUtils]: 146: Hoare triple {10850#false} call ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset := ldv_zalloc(1560); {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:42,103 INFO L290 TraceCheckUtils]: 147: Hoare triple {10972#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {10849#true} is VALID [2022-02-20 21:53:42,103 INFO L290 TraceCheckUtils]: 148: Hoare triple {10849#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {10849#true} is VALID [2022-02-20 21:53:42,103 INFO L290 TraceCheckUtils]: 149: Hoare triple {10849#true} assume true; {10849#true} is VALID [2022-02-20 21:53:42,103 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {10849#true} {10850#false} #908#return; {10850#false} is VALID [2022-02-20 21:53:42,103 INFO L290 TraceCheckUtils]: 151: Hoare triple {10850#false} ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset := ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {10850#false} is VALID [2022-02-20 21:53:42,103 INFO L290 TraceCheckUtils]: 152: Hoare triple {10850#false} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_12_#res#1 := ldv_usb_register_driver_12_~ldv_func_res~0#1; {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 153: Hoare triple {10850#false} eem_driver_init_#t~ret156#1 := ldv_usb_register_driver_12_#res#1;assume { :end_inline_ldv_usb_register_driver_12 } true;assume -2147483648 <= eem_driver_init_#t~ret156#1 && eem_driver_init_#t~ret156#1 <= 2147483647;eem_driver_init_~tmp~15#1 := eem_driver_init_#t~ret156#1;havoc eem_driver_init_#t~ret156#1;eem_driver_init_#res#1 := eem_driver_init_~tmp~15#1; {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 154: Hoare triple {10850#false} main_#t~ret175#1 := eem_driver_init_#res#1;assume { :end_inline_eem_driver_init } true;assume -2147483648 <= main_#t~ret175#1 && main_#t~ret175#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret175#1;havoc main_#t~ret175#1; {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 155: Hoare triple {10850#false} assume !(0 == ~ldv_retval_4~0); {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 156: Hoare triple {10850#false} assume 0 != ~ldv_retval_4~0;~ldv_state_variable_0~0 := 2; {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 157: Hoare triple {10850#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {10850#false} is VALID [2022-02-20 21:53:42,104 INFO L290 TraceCheckUtils]: 158: Hoare triple {10850#false} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {10850#false} is VALID [2022-02-20 21:53:42,105 INFO L290 TraceCheckUtils]: 159: Hoare triple {10850#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {10850#false} is VALID [2022-02-20 21:53:42,105 INFO L272 TraceCheckUtils]: 160: Hoare triple {10850#false} call ldv_error(); {10850#false} is VALID [2022-02-20 21:53:42,105 INFO L290 TraceCheckUtils]: 161: Hoare triple {10850#false} assume !false; {10850#false} is VALID [2022-02-20 21:53:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-02-20 21:53:42,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:42,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730115335] [2022-02-20 21:53:42,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730115335] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:42,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:42,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:53:42,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417523494] [2022-02-20 21:53:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:42,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-02-20 21:53:42,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:42,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:42,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:42,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:53:42,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:53:42,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:53:42,224 INFO L87 Difference]: Start difference. First operand 1219 states and 1657 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:47,193 INFO L93 Difference]: Finished difference Result 2919 states and 4033 transitions. [2022-02-20 21:53:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:53:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2022-02-20 21:53:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1032 transitions. [2022-02-20 21:53:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1032 transitions. [2022-02-20 21:53:47,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1032 transitions. [2022-02-20 21:53:48,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1032 edges. 1032 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:48,372 INFO L225 Difference]: With dead ends: 2919 [2022-02-20 21:53:48,372 INFO L226 Difference]: Without dead ends: 1716 [2022-02-20 21:53:48,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:53:48,379 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 736 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:53:48,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1047 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 21:53:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-02-20 21:53:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1448. [2022-02-20 21:53:48,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:53:48,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1716 states. Second operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-02-20 21:53:48,450 INFO L74 IsIncluded]: Start isIncluded. First operand 1716 states. Second operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-02-20 21:53:48,455 INFO L87 Difference]: Start difference. First operand 1716 states. Second operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-02-20 21:53:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:48,598 INFO L93 Difference]: Finished difference Result 1716 states and 2392 transitions. [2022-02-20 21:53:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2392 transitions. [2022-02-20 21:53:48,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:48,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:48,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) Second operand 1716 states. [2022-02-20 21:53:48,611 INFO L87 Difference]: Start difference. First operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) Second operand 1716 states. [2022-02-20 21:53:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:48,755 INFO L93 Difference]: Finished difference Result 1716 states and 2392 transitions. [2022-02-20 21:53:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2392 transitions. [2022-02-20 21:53:48,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:53:48,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:53:48,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:53:48,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:53:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1200 states have (on average 1.3708333333333333) internal successors, (1645), 1212 states have internal predecessors, (1645), 162 states have call successors, (162), 80 states have call predecessors, (162), 85 states have return successors, (177), 163 states have call predecessors, (177), 161 states have call successors, (177) [2022-02-20 21:53:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1984 transitions. [2022-02-20 21:53:48,904 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1984 transitions. Word has length 162 [2022-02-20 21:53:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:53:48,905 INFO L470 AbstractCegarLoop]: Abstraction has 1448 states and 1984 transitions. [2022-02-20 21:53:48,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-02-20 21:53:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1984 transitions. [2022-02-20 21:53:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-02-20 21:53:48,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:53:48,915 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:53:48,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:53:48,918 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:53:48,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:53:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1866479413, now seen corresponding path program 1 times [2022-02-20 21:53:48,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:53:48,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761141900] [2022-02-20 21:53:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:53:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:53:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:53:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #894#return; {20288#true} is VALID [2022-02-20 21:53:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:53:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #896#return; {20288#true} is VALID [2022-02-20 21:53:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:53:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {20288#true} is VALID [2022-02-20 21:53:49,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20288#true} is VALID [2022-02-20 21:53:49,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #898#return; {20288#true} is VALID [2022-02-20 21:53:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:53:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {20288#true} is VALID [2022-02-20 21:53:49,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20288#true} is VALID [2022-02-20 21:53:49,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #900#return; {20288#true} is VALID [2022-02-20 21:53:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:53:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #908#return; {20288#true} is VALID [2022-02-20 21:53:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:53:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20310#(= ~ldv_state_variable_2~0 1)} #910#return; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:53:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20310#(= ~ldv_state_variable_2~0 1)} #912#return; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 21:53:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 21:53:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,300 INFO L272 TraceCheckUtils]: 1: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,301 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20288#true} {20288#true} #856#return; {20288#true} is VALID [2022-02-20 21:53:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:53:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #852#return; {20288#true} is VALID [2022-02-20 21:53:49,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,320 INFO L272 TraceCheckUtils]: 1: Hoare triple {20288#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,321 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20288#true} {20288#true} #852#return; {20288#true} is VALID [2022-02-20 21:53:49,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {20288#true} is VALID [2022-02-20 21:53:49,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,321 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20288#true} {20288#true} #860#return; {20288#true} is VALID [2022-02-20 21:53:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 21:53:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {20288#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {20288#true} is VALID [2022-02-20 21:53:49,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20288#true} {20288#true} #862#return; {20288#true} is VALID [2022-02-20 21:53:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:53:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {20288#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20288#true} {20288#true} #864#return; {20288#true} is VALID [2022-02-20 21:53:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:53:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #850#return; {20288#true} is VALID [2022-02-20 21:53:49,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,360 INFO L272 TraceCheckUtils]: 1: Hoare triple {20288#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,360 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20288#true} {20288#true} #850#return; {20288#true} is VALID [2022-02-20 21:53:49,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {20288#true} is VALID [2022-02-20 21:53:49,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,361 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20288#true} {20288#true} #866#return; {20288#true} is VALID [2022-02-20 21:53:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:53:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {20288#true} is VALID [2022-02-20 21:53:49,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20288#true} {20288#true} #868#return; {20288#true} is VALID [2022-02-20 21:53:49,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:53:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #870#return; {20288#true} is VALID [2022-02-20 21:53:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:53:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} ~last_index~0 := ~last_index~0 - 1; {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20288#true} {20288#true} #854#return; {20288#true} is VALID [2022-02-20 21:53:49,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {20288#true} is VALID [2022-02-20 21:53:49,413 INFO L272 TraceCheckUtils]: 1: Hoare triple {20288#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {20288#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {20288#true} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {20288#true} ~last_index~0 := ~last_index~0 - 1; {20288#true} is VALID [2022-02-20 21:53:49,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20288#true} {20288#true} #854#return; {20288#true} is VALID [2022-02-20 21:53:49,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,415 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20288#true} {20288#true} #874#return; {20288#true} is VALID [2022-02-20 21:53:49,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-20 21:53:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:53:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:53:49,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,432 INFO L272 TraceCheckUtils]: 1: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20288#true} {20288#true} #888#return; {20288#true} is VALID [2022-02-20 21:53:49,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {20421#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {20288#true} is VALID [2022-02-20 21:53:49,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {20288#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {20288#true} is VALID [2022-02-20 21:53:49,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {20288#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {20288#true} is VALID [2022-02-20 21:53:49,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {20288#true} is VALID [2022-02-20 21:53:49,435 INFO L272 TraceCheckUtils]: 5: Hoare triple {20288#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,436 INFO L272 TraceCheckUtils]: 7: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,436 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {20288#true} {20288#true} #856#return; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {20288#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {20288#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {20288#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {20288#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {20288#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {20288#true} is VALID [2022-02-20 21:53:49,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {20288#true} assume #t~switch130#1; {20288#true} is VALID [2022-02-20 21:53:49,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {20288#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {20288#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {20288#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {20288#true} is VALID [2022-02-20 21:53:49,439 INFO L272 TraceCheckUtils]: 24: Hoare triple {20288#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,440 INFO L272 TraceCheckUtils]: 26: Hoare triple {20288#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,440 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20288#true} {20288#true} #852#return; {20288#true} is VALID [2022-02-20 21:53:49,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {20288#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {20288#true} {20288#true} #860#return; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {20288#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L272 TraceCheckUtils]: 35: Hoare triple {20288#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {20288#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,441 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20288#true} {20288#true} #862#return; {20288#true} is VALID [2022-02-20 21:53:49,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {20288#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {20288#true} is VALID [2022-02-20 21:53:49,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {20288#true} assume !(0 != ~tmp___0~4#1); {20288#true} is VALID [2022-02-20 21:53:49,442 INFO L272 TraceCheckUtils]: 41: Hoare triple {20288#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {20288#true} is VALID [2022-02-20 21:53:49,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {20288#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,445 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20288#true} {20288#true} #864#return; {20288#true} is VALID [2022-02-20 21:53:49,446 INFO L272 TraceCheckUtils]: 45: Hoare triple {20288#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,447 INFO L272 TraceCheckUtils]: 47: Hoare triple {20288#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,447 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20288#true} {20288#true} #850#return; {20288#true} is VALID [2022-02-20 21:53:49,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {20288#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {20288#true} is VALID [2022-02-20 21:53:49,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,448 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20288#true} {20288#true} #866#return; {20288#true} is VALID [2022-02-20 21:53:49,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {20288#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,449 INFO L272 TraceCheckUtils]: 56: Hoare triple {20288#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:49,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {20288#true} is VALID [2022-02-20 21:53:49,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,450 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20288#true} {20288#true} #868#return; {20288#true} is VALID [2022-02-20 21:53:49,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {20288#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {20288#true} is VALID [2022-02-20 21:53:49,450 INFO L272 TraceCheckUtils]: 61: Hoare triple {20288#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,450 INFO L290 TraceCheckUtils]: 62: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L290 TraceCheckUtils]: 63: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L290 TraceCheckUtils]: 64: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20288#true} {20288#true} #870#return; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L290 TraceCheckUtils]: 66: Hoare triple {20288#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {20288#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {20288#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {20288#true} is VALID [2022-02-20 21:53:49,452 INFO L272 TraceCheckUtils]: 69: Hoare triple {20288#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {20288#true} is VALID [2022-02-20 21:53:49,453 INFO L272 TraceCheckUtils]: 71: Hoare triple {20288#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {20288#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {20288#true} ~last_index~0 := ~last_index~0 - 1; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20288#true} {20288#true} #854#return; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {20288#true} {20288#true} #874#return; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {20288#true} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {20288#true} assume { :end_inline_eem_linkcmd } true; {20288#true} is VALID [2022-02-20 21:53:49,456 INFO L272 TraceCheckUtils]: 85: Hoare triple {20288#true} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,457 INFO L272 TraceCheckUtils]: 87: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,471 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,471 INFO L290 TraceCheckUtils]: 92: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,471 INFO L290 TraceCheckUtils]: 93: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {20288#true} {20288#true} #888#return; {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {20288#true} havoc #t~ret154#1.base, #t~ret154#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {20288#true} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {20288#true} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L290 TraceCheckUtils]: 98: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,472 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {20288#true} {20289#false} #918#return; {20289#false} is VALID [2022-02-20 21:53:49,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {20288#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {20288#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {20288#true} is VALID [2022-02-20 21:53:49,476 INFO L272 TraceCheckUtils]: 2: Hoare triple {20288#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,476 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20288#true} {20288#true} #894#return; {20288#true} is VALID [2022-02-20 21:53:49,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {20288#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {20288#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,478 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20288#true} {20288#true} #896#return; {20288#true} is VALID [2022-02-20 21:53:49,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {20288#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {20288#true} is VALID [2022-02-20 21:53:49,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {20288#true} assume { :end_inline_ldv_set_init } true; {20288#true} is VALID [2022-02-20 21:53:49,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {20288#true} assume { :end_inline_ldv_initialize } true; {20288#true} is VALID [2022-02-20 21:53:49,479 INFO L272 TraceCheckUtils]: 16: Hoare triple {20288#true} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:49,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {20288#true} is VALID [2022-02-20 21:53:49,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {20288#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {20288#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20288#true} is VALID [2022-02-20 21:53:49,480 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20288#true} {20288#true} #898#return; {20288#true} is VALID [2022-02-20 21:53:49,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {20288#true} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,481 INFO L272 TraceCheckUtils]: 22: Hoare triple {20288#true} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:49,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {20288#true} is VALID [2022-02-20 21:53:49,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {20288#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {20288#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20288#true} is VALID [2022-02-20 21:53:49,481 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20288#true} {20288#true} #900#return; {20288#true} is VALID [2022-02-20 21:53:49,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {20288#true} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {20288#true} is VALID [2022-02-20 21:53:49,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {20288#true} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {20288#true} is VALID [2022-02-20 21:53:49,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {20288#true} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {20288#true} is VALID [2022-02-20 21:53:49,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {20288#true} assume main_#t~switch165#1; {20288#true} is VALID [2022-02-20 21:53:49,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {20288#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {20288#true} is VALID [2022-02-20 21:53:49,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {20288#true} assume !main_#t~switch174#1;main_#t~switch174#1 := main_#t~switch174#1 || 1 == main_~tmp___3~2#1; {20288#true} is VALID [2022-02-20 21:53:49,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {20288#true} assume main_#t~switch174#1; {20288#true} is VALID [2022-02-20 21:53:49,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {20288#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_eem_driver_init } true;havoc eem_driver_init_#res#1;havoc eem_driver_init_#t~ret156#1, eem_driver_init_~tmp~15#1;havoc eem_driver_init_~tmp~15#1;assume { :begin_inline_ldv_usb_register_driver_12 } true;ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 12, 0;havoc ldv_usb_register_driver_12_#res#1;havoc ldv_usb_register_driver_12_#t~ret186#1, ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset, ldv_usb_register_driver_12_~ldv_func_res~0#1, ldv_usb_register_driver_12_~tmp~19#1;ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_12_~ldv_func_res~0#1;havoc ldv_usb_register_driver_12_~tmp~19#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet210#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet210#1 && usb_register_driver_#t~nondet210#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet210#1;havoc usb_register_driver_#t~nondet210#1; {20288#true} is VALID [2022-02-20 21:53:49,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {20288#true} ldv_usb_register_driver_12_#t~ret186#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_12_#t~ret186#1 && ldv_usb_register_driver_12_#t~ret186#1 <= 2147483647;ldv_usb_register_driver_12_~tmp~19#1 := ldv_usb_register_driver_12_#t~ret186#1;havoc ldv_usb_register_driver_12_#t~ret186#1;ldv_usb_register_driver_12_~ldv_func_res~0#1 := ldv_usb_register_driver_12_~tmp~19#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset, ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset;havoc ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L272 TraceCheckUtils]: 36: Hoare triple {20288#true} call ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset := ldv_zalloc(1560); {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20288#true} {20288#true} #908#return; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {20288#true} ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset := ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {20288#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_12_#res#1 := ldv_usb_register_driver_12_~ldv_func_res~0#1; {20288#true} is VALID [2022-02-20 21:53:49,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {20288#true} eem_driver_init_#t~ret156#1 := ldv_usb_register_driver_12_#res#1;assume { :end_inline_ldv_usb_register_driver_12 } true;assume -2147483648 <= eem_driver_init_#t~ret156#1 && eem_driver_init_#t~ret156#1 <= 2147483647;eem_driver_init_~tmp~15#1 := eem_driver_init_#t~ret156#1;havoc eem_driver_init_#t~ret156#1;eem_driver_init_#res#1 := eem_driver_init_~tmp~15#1; {20288#true} is VALID [2022-02-20 21:53:49,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {20288#true} main_#t~ret175#1 := eem_driver_init_#res#1;assume { :end_inline_eem_driver_init } true;assume -2147483648 <= main_#t~ret175#1 && main_#t~ret175#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret175#1;havoc main_#t~ret175#1; {20288#true} is VALID [2022-02-20 21:53:49,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {20288#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset, ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset, ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,486 INFO L272 TraceCheckUtils]: 46: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} call ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset := ldv_zalloc(1472); {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,487 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20288#true} {20310#(= ~ldv_state_variable_2~0 1)} #910#return; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset := ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;~eem_info_group0~0.base, ~eem_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,488 INFO L272 TraceCheckUtils]: 52: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} call ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset := ldv_zalloc(232); {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {20419#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {20288#true} is VALID [2022-02-20 21:53:49,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {20288#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,489 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {20288#true} {20310#(= ~ldv_state_variable_2~0 1)} #912#return; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;havoc ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;~eem_info_group1~0.base, ~eem_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume { :end_inline_ldv_initialize_driver_info_2 } true; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume !(0 != ~ldv_retval_4~0); {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,491 INFO L290 TraceCheckUtils]: 60: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,491 INFO L290 TraceCheckUtils]: 61: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,491 INFO L290 TraceCheckUtils]: 62: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 2 == main_~tmp___1~3#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch165#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,492 INFO L290 TraceCheckUtils]: 64: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet176#1 && main_#t~nondet176#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet176#1;havoc main_#t~nondet176#1;main_#t~switch177#1 := 0 == main_~tmp___4~2#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch177#1; {20310#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:53:49,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {20310#(= ~ldv_state_variable_2~0 1)} assume !(1 == ~ldv_state_variable_2~0); {20289#false} is VALID [2022-02-20 21:53:49,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {20289#false} assume 2 == ~ldv_state_variable_2~0; {20289#false} is VALID [2022-02-20 21:53:49,493 INFO L272 TraceCheckUtils]: 68: Hoare triple {20289#false} call main_#t~ret179#1 := eem_rx_fixup(~eem_info_group0~0.base, ~eem_info_group0~0.offset, ~eem_info_group1~0.base, ~eem_info_group1~0.offset); {20421#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {20421#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {20288#true} is VALID [2022-02-20 21:53:49,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {20288#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,494 INFO L290 TraceCheckUtils]: 71: Hoare triple {20288#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {20288#true} is VALID [2022-02-20 21:53:49,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {20288#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {20288#true} is VALID [2022-02-20 21:53:49,494 INFO L290 TraceCheckUtils]: 73: Hoare triple {20288#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {20288#true} is VALID [2022-02-20 21:53:49,495 INFO L272 TraceCheckUtils]: 74: Hoare triple {20288#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,495 INFO L290 TraceCheckUtils]: 75: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,495 INFO L272 TraceCheckUtils]: 76: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,503 INFO L290 TraceCheckUtils]: 78: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,503 INFO L290 TraceCheckUtils]: 79: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L290 TraceCheckUtils]: 81: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L290 TraceCheckUtils]: 82: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20288#true} {20288#true} #856#return; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {20288#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {20288#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 86: Hoare triple {20288#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {20288#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 88: Hoare triple {20288#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 89: Hoare triple {20288#true} assume #t~switch130#1; {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {20288#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 91: Hoare triple {20288#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,505 INFO L290 TraceCheckUtils]: 92: Hoare triple {20288#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {20288#true} is VALID [2022-02-20 21:53:49,506 INFO L272 TraceCheckUtils]: 93: Hoare triple {20288#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,507 INFO L272 TraceCheckUtils]: 95: Hoare triple {20288#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,507 INFO L290 TraceCheckUtils]: 96: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,507 INFO L290 TraceCheckUtils]: 97: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L290 TraceCheckUtils]: 98: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {20288#true} {20288#true} #852#return; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L290 TraceCheckUtils]: 100: Hoare triple {20288#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L290 TraceCheckUtils]: 101: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {20288#true} {20288#true} #860#return; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L290 TraceCheckUtils]: 103: Hoare triple {20288#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,508 INFO L272 TraceCheckUtils]: 104: Hoare triple {20288#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L290 TraceCheckUtils]: 105: Hoare triple {20288#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {20288#true} {20288#true} #862#return; {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L290 TraceCheckUtils]: 108: Hoare triple {20288#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L290 TraceCheckUtils]: 109: Hoare triple {20288#true} assume !(0 != ~tmp___0~4#1); {20288#true} is VALID [2022-02-20 21:53:49,509 INFO L272 TraceCheckUtils]: 110: Hoare triple {20288#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {20288#true} is VALID [2022-02-20 21:53:49,510 INFO L290 TraceCheckUtils]: 111: Hoare triple {20288#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,510 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {20288#true} {20288#true} #864#return; {20288#true} is VALID [2022-02-20 21:53:49,511 INFO L272 TraceCheckUtils]: 114: Hoare triple {20288#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,511 INFO L290 TraceCheckUtils]: 115: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,511 INFO L272 TraceCheckUtils]: 116: Hoare triple {20288#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L290 TraceCheckUtils]: 119: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {20288#true} {20288#true} #850#return; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {20288#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L290 TraceCheckUtils]: 122: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,512 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {20288#true} {20288#true} #866#return; {20288#true} is VALID [2022-02-20 21:53:49,513 INFO L290 TraceCheckUtils]: 124: Hoare triple {20288#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,514 INFO L272 TraceCheckUtils]: 125: Hoare triple {20288#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:53:49,514 INFO L290 TraceCheckUtils]: 126: Hoare triple {20420#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {20288#true} is VALID [2022-02-20 21:53:49,514 INFO L290 TraceCheckUtils]: 127: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,514 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {20288#true} {20288#true} #868#return; {20288#true} is VALID [2022-02-20 21:53:49,514 INFO L290 TraceCheckUtils]: 129: Hoare triple {20288#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {20288#true} is VALID [2022-02-20 21:53:49,515 INFO L272 TraceCheckUtils]: 130: Hoare triple {20288#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,515 INFO L290 TraceCheckUtils]: 131: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,515 INFO L290 TraceCheckUtils]: 132: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,515 INFO L290 TraceCheckUtils]: 133: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,515 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20288#true} {20288#true} #870#return; {20288#true} is VALID [2022-02-20 21:53:49,516 INFO L290 TraceCheckUtils]: 135: Hoare triple {20288#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,516 INFO L290 TraceCheckUtils]: 136: Hoare triple {20288#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,516 INFO L290 TraceCheckUtils]: 137: Hoare triple {20288#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {20288#true} is VALID [2022-02-20 21:53:49,517 INFO L272 TraceCheckUtils]: 138: Hoare triple {20288#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,517 INFO L290 TraceCheckUtils]: 139: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {20288#true} is VALID [2022-02-20 21:53:49,518 INFO L272 TraceCheckUtils]: 140: Hoare triple {20288#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:53:49,518 INFO L290 TraceCheckUtils]: 141: Hoare triple {20497#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {20288#true} is VALID [2022-02-20 21:53:49,518 INFO L290 TraceCheckUtils]: 142: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,518 INFO L290 TraceCheckUtils]: 143: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 144: Hoare triple {20288#true} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 145: Hoare triple {20288#true} assume !false; {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 146: Hoare triple {20288#true} assume !(~i~1 < ~last_index~0); {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 147: Hoare triple {20288#true} ~last_index~0 := ~last_index~0 - 1; {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 148: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {20288#true} {20288#true} #854#return; {20288#true} is VALID [2022-02-20 21:53:49,519 INFO L290 TraceCheckUtils]: 150: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,520 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {20288#true} {20288#true} #874#return; {20288#true} is VALID [2022-02-20 21:53:49,520 INFO L290 TraceCheckUtils]: 152: Hoare triple {20288#true} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,520 INFO L290 TraceCheckUtils]: 153: Hoare triple {20288#true} assume { :end_inline_eem_linkcmd } true; {20288#true} is VALID [2022-02-20 21:53:49,521 INFO L272 TraceCheckUtils]: 154: Hoare triple {20288#true} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,521 INFO L290 TraceCheckUtils]: 155: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {20288#true} is VALID [2022-02-20 21:53:49,521 INFO L272 TraceCheckUtils]: 156: Hoare triple {20288#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:53:49,522 INFO L290 TraceCheckUtils]: 157: Hoare triple {20484#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {20288#true} is VALID [2022-02-20 21:53:49,522 INFO L290 TraceCheckUtils]: 158: Hoare triple {20288#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {20288#true} is VALID [2022-02-20 21:53:49,522 INFO L290 TraceCheckUtils]: 159: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,522 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {20288#true} {20288#true} #848#return; {20288#true} is VALID [2022-02-20 21:53:49,522 INFO L290 TraceCheckUtils]: 161: Hoare triple {20288#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {20288#true} is VALID [2022-02-20 21:53:49,522 INFO L290 TraceCheckUtils]: 162: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L284 TraceCheckUtils]: 163: Hoare quadruple {20288#true} {20288#true} #888#return; {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L290 TraceCheckUtils]: 164: Hoare triple {20288#true} havoc #t~ret154#1.base, #t~ret154#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L290 TraceCheckUtils]: 165: Hoare triple {20288#true} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L290 TraceCheckUtils]: 166: Hoare triple {20288#true} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L290 TraceCheckUtils]: 167: Hoare triple {20288#true} assume true; {20288#true} is VALID [2022-02-20 21:53:49,523 INFO L284 TraceCheckUtils]: 168: Hoare quadruple {20288#true} {20289#false} #918#return; {20289#false} is VALID [2022-02-20 21:53:49,523 INFO L290 TraceCheckUtils]: 169: Hoare triple {20289#false} assume -2147483648 <= main_#t~ret179#1 && main_#t~ret179#1 <= 2147483647;havoc main_#t~ret179#1;~ldv_state_variable_2~0 := 2; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 170: Hoare triple {20289#false} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 171: Hoare triple {20289#false} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 172: Hoare triple {20289#false} assume main_#t~switch165#1; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 173: Hoare triple {20289#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 174: Hoare triple {20289#false} assume main_#t~switch174#1; {20289#false} is VALID [2022-02-20 21:53:49,524 INFO L290 TraceCheckUtils]: 175: Hoare triple {20289#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_eem_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_13 } true;ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset;havoc ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset := ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 176: Hoare triple {20289#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 177: Hoare triple {20289#false} assume { :end_inline_ldv_usb_deregister_13 } true; {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 178: Hoare triple {20289#false} assume { :end_inline_eem_driver_exit } true;~ldv_state_variable_0~0 := 2; {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 179: Hoare triple {20289#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 180: Hoare triple {20289#false} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L290 TraceCheckUtils]: 181: Hoare triple {20289#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {20289#false} is VALID [2022-02-20 21:53:49,525 INFO L272 TraceCheckUtils]: 182: Hoare triple {20289#false} call ldv_error(); {20289#false} is VALID [2022-02-20 21:53:49,526 INFO L290 TraceCheckUtils]: 183: Hoare triple {20289#false} assume !false; {20289#false} is VALID [2022-02-20 21:53:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-20 21:53:49,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:53:49,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761141900] [2022-02-20 21:53:49,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761141900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:53:49,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:53:49,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:53:49,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613264010] [2022-02-20 21:53:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:53:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 184 [2022-02-20 21:53:49,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:53:49,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-02-20 21:53:49,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:53:49,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:53:49,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:53:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:53:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:53:49,669 INFO L87 Difference]: Start difference. First operand 1448 states and 1984 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-02-20 21:53:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:53:59,469 INFO L93 Difference]: Finished difference Result 4491 states and 6219 transitions. [2022-02-20 21:53:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 21:53:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 184 [2022-02-20 21:53:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:53:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-02-20 21:53:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1427 transitions. [2022-02-20 21:53:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-02-20 21:53:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1427 transitions. [2022-02-20 21:53:59,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1427 transitions. [2022-02-20 21:54:00,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1427 edges. 1427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:01,112 INFO L225 Difference]: With dead ends: 4491 [2022-02-20 21:54:01,112 INFO L226 Difference]: Without dead ends: 3070 [2022-02-20 21:54:01,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:54:01,118 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 963 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:01,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1009 Valid, 1756 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 21:54:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2022-02-20 21:54:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2556. [2022-02-20 21:54:01,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:01,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3070 states. Second operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:01,217 INFO L74 IsIncluded]: Start isIncluded. First operand 3070 states. Second operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:01,223 INFO L87 Difference]: Start difference. First operand 3070 states. Second operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:01,495 INFO L93 Difference]: Finished difference Result 3070 states and 4238 transitions. [2022-02-20 21:54:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4238 transitions. [2022-02-20 21:54:01,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:01,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:01,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) Second operand 3070 states. [2022-02-20 21:54:01,521 INFO L87 Difference]: Start difference. First operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) Second operand 3070 states. [2022-02-20 21:54:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:01,822 INFO L93 Difference]: Finished difference Result 3070 states and 4238 transitions. [2022-02-20 21:54:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4238 transitions. [2022-02-20 21:54:01,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:01,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:01,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:01,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2114 states have (on average 1.3571428571428572) internal successors, (2869), 2138 states have internal predecessors, (2869), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3460 transitions. [2022-02-20 21:54:02,155 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3460 transitions. Word has length 184 [2022-02-20 21:54:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:02,155 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 3460 transitions. [2022-02-20 21:54:02,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (22), 7 states have call predecessors, (22), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-02-20 21:54:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3460 transitions. [2022-02-20 21:54:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-02-20 21:54:02,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:02,160 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:02,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:54:02,161 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1671695385, now seen corresponding path program 1 times [2022-02-20 21:54:02,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:02,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280016633] [2022-02-20 21:54:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #894#return; {35934#true} is VALID [2022-02-20 21:54:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #896#return; {35934#true} is VALID [2022-02-20 21:54:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:54:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {35934#true} is VALID [2022-02-20 21:54:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {35934#true} is VALID [2022-02-20 21:54:02,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #898#return; {35934#true} is VALID [2022-02-20 21:54:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:54:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {35934#true} is VALID [2022-02-20 21:54:02,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {35934#true} is VALID [2022-02-20 21:54:02,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #900#return; {35934#true} is VALID [2022-02-20 21:54:02,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:54:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #908#return; {35934#true} is VALID [2022-02-20 21:54:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:54:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #910#return; {35934#true} is VALID [2022-02-20 21:54:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:54:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #912#return; {35934#true} is VALID [2022-02-20 21:54:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:54:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 21:54:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,454 INFO L272 TraceCheckUtils]: 1: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,455 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,456 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35934#true} {35934#true} #856#return; {35934#true} is VALID [2022-02-20 21:54:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:54:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #852#return; {35934#true} is VALID [2022-02-20 21:54:02,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,472 INFO L272 TraceCheckUtils]: 1: Hoare triple {35934#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,472 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {35934#true} {35934#true} #852#return; {35934#true} is VALID [2022-02-20 21:54:02,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {35934#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {35934#true} is VALID [2022-02-20 21:54:02,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,473 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35934#true} {35934#true} #860#return; {35934#true} is VALID [2022-02-20 21:54:02,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 21:54:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {35934#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {35934#true} is VALID [2022-02-20 21:54:02,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35934#true} {35934#true} #862#return; {35934#true} is VALID [2022-02-20 21:54:02,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:54:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {35934#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35934#true} {35934#true} #864#return; {35934#true} is VALID [2022-02-20 21:54:02,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #850#return; {35934#true} is VALID [2022-02-20 21:54:02,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,502 INFO L272 TraceCheckUtils]: 1: Hoare triple {35934#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,503 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {35934#true} {35934#true} #850#return; {35934#true} is VALID [2022-02-20 21:54:02,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {35934#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {35934#true} is VALID [2022-02-20 21:54:02,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,504 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35934#true} {35934#true} #866#return; {35934#true} is VALID [2022-02-20 21:54:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:54:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {35934#true} is VALID [2022-02-20 21:54:02,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35934#true} {35934#true} #868#return; {35934#true} is VALID [2022-02-20 21:54:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:54:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #870#return; {35934#true} is VALID [2022-02-20 21:54:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:54:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {35935#false} is VALID [2022-02-20 21:54:02,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {35935#false} assume !false; {35935#false} is VALID [2022-02-20 21:54:02,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {35935#false} assume !(~i~1 < ~last_index~0); {35935#false} is VALID [2022-02-20 21:54:02,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {35935#false} ~last_index~0 := ~last_index~0 - 1; {35935#false} is VALID [2022-02-20 21:54:02,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,577 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35935#false} {35934#true} #854#return; {35935#false} is VALID [2022-02-20 21:54:02,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {35934#true} is VALID [2022-02-20 21:54:02,578 INFO L272 TraceCheckUtils]: 1: Hoare triple {35934#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {35935#false} assume !false; {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {35935#false} assume !(~i~1 < ~last_index~0); {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {35935#false} ~last_index~0 := ~last_index~0 - 1; {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35935#false} {35934#true} #854#return; {35935#false} is VALID [2022-02-20 21:54:02,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,582 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35935#false} {35934#true} #874#return; {35935#false} is VALID [2022-02-20 21:54:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-20 21:54:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:02,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,599 INFO L272 TraceCheckUtils]: 1: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,600 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,600 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {35934#true} {35935#false} #888#return; {35935#false} is VALID [2022-02-20 21:54:02,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {36066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {35934#true} is VALID [2022-02-20 21:54:02,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35934#true} is VALID [2022-02-20 21:54:02,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {35934#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {35934#true} is VALID [2022-02-20 21:54:02,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {35934#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {35934#true} is VALID [2022-02-20 21:54:02,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {35934#true} is VALID [2022-02-20 21:54:02,602 INFO L272 TraceCheckUtils]: 5: Hoare triple {35934#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,603 INFO L272 TraceCheckUtils]: 7: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,603 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,604 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {35934#true} {35934#true} #856#return; {35934#true} is VALID [2022-02-20 21:54:02,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {35934#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {35934#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {35934#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {35934#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {35934#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {35934#true} assume #t~switch130#1; {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {35934#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {35934#true} is VALID [2022-02-20 21:54:02,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {35934#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35934#true} is VALID [2022-02-20 21:54:02,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {35934#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {35934#true} is VALID [2022-02-20 21:54:02,606 INFO L272 TraceCheckUtils]: 24: Hoare triple {35934#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,607 INFO L272 TraceCheckUtils]: 26: Hoare triple {35934#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {35934#true} {35934#true} #852#return; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {35934#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,608 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {35934#true} {35934#true} #860#return; {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {35934#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L272 TraceCheckUtils]: 35: Hoare triple {35934#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {35934#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {35934#true} {35934#true} #862#return; {35934#true} is VALID [2022-02-20 21:54:02,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {35934#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {35934#true} is VALID [2022-02-20 21:54:02,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {35934#true} assume !(0 != ~tmp___0~4#1); {35934#true} is VALID [2022-02-20 21:54:02,610 INFO L272 TraceCheckUtils]: 41: Hoare triple {35934#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {35934#true} is VALID [2022-02-20 21:54:02,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {35934#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,610 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {35934#true} {35934#true} #864#return; {35934#true} is VALID [2022-02-20 21:54:02,611 INFO L272 TraceCheckUtils]: 45: Hoare triple {35934#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,612 INFO L272 TraceCheckUtils]: 47: Hoare triple {35934#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,613 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35934#true} {35934#true} #850#return; {35934#true} is VALID [2022-02-20 21:54:02,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {35934#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {35934#true} is VALID [2022-02-20 21:54:02,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,613 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {35934#true} {35934#true} #866#return; {35934#true} is VALID [2022-02-20 21:54:02,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {35934#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,614 INFO L272 TraceCheckUtils]: 56: Hoare triple {35934#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:02,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {35934#true} is VALID [2022-02-20 21:54:02,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,615 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35934#true} {35934#true} #868#return; {35934#true} is VALID [2022-02-20 21:54:02,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {35934#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {35934#true} is VALID [2022-02-20 21:54:02,616 INFO L272 TraceCheckUtils]: 61: Hoare triple {35934#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,616 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {35934#true} {35934#true} #870#return; {35934#true} is VALID [2022-02-20 21:54:02,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {35934#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {35934#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {35934#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {35934#true} is VALID [2022-02-20 21:54:02,618 INFO L272 TraceCheckUtils]: 69: Hoare triple {35934#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {35934#true} is VALID [2022-02-20 21:54:02,619 INFO L272 TraceCheckUtils]: 71: Hoare triple {35934#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {35935#false} is VALID [2022-02-20 21:54:02,621 INFO L290 TraceCheckUtils]: 76: Hoare triple {35935#false} assume !false; {35935#false} is VALID [2022-02-20 21:54:02,621 INFO L290 TraceCheckUtils]: 77: Hoare triple {35935#false} assume !(~i~1 < ~last_index~0); {35935#false} is VALID [2022-02-20 21:54:02,621 INFO L290 TraceCheckUtils]: 78: Hoare triple {35935#false} ~last_index~0 := ~last_index~0 - 1; {35935#false} is VALID [2022-02-20 21:54:02,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,622 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {35935#false} {35934#true} #854#return; {35935#false} is VALID [2022-02-20 21:54:02,622 INFO L290 TraceCheckUtils]: 81: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,622 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35935#false} {35934#true} #874#return; {35935#false} is VALID [2022-02-20 21:54:02,622 INFO L290 TraceCheckUtils]: 83: Hoare triple {35935#false} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {35935#false} assume { :end_inline_eem_linkcmd } true; {35935#false} is VALID [2022-02-20 21:54:02,623 INFO L272 TraceCheckUtils]: 85: Hoare triple {35935#false} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,624 INFO L272 TraceCheckUtils]: 87: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,624 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,625 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {35934#true} {35935#false} #888#return; {35935#false} is VALID [2022-02-20 21:54:02,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {35935#false} havoc #t~ret154#1.base, #t~ret154#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {35935#false} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35935#false} is VALID [2022-02-20 21:54:02,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {35935#false} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,626 INFO L290 TraceCheckUtils]: 98: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,626 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {35935#false} {35934#true} #916#return; {35935#false} is VALID [2022-02-20 21:54:02,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {35934#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {35934#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {35934#true} is VALID [2022-02-20 21:54:02,627 INFO L272 TraceCheckUtils]: 2: Hoare triple {35934#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,628 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35934#true} {35934#true} #894#return; {35934#true} is VALID [2022-02-20 21:54:02,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {35934#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {35934#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,629 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35934#true} {35934#true} #896#return; {35934#true} is VALID [2022-02-20 21:54:02,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {35934#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {35934#true} is VALID [2022-02-20 21:54:02,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {35934#true} assume { :end_inline_ldv_set_init } true; {35934#true} is VALID [2022-02-20 21:54:02,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {35934#true} assume { :end_inline_ldv_initialize } true; {35934#true} is VALID [2022-02-20 21:54:02,631 INFO L272 TraceCheckUtils]: 16: Hoare triple {35934#true} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:02,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {35934#true} is VALID [2022-02-20 21:54:02,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {35934#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {35934#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {35934#true} is VALID [2022-02-20 21:54:02,632 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35934#true} {35934#true} #898#return; {35934#true} is VALID [2022-02-20 21:54:02,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {35934#true} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,633 INFO L272 TraceCheckUtils]: 22: Hoare triple {35934#true} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:02,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {35934#true} is VALID [2022-02-20 21:54:02,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {35934#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {35934#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {35934#true} is VALID [2022-02-20 21:54:02,634 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35934#true} {35934#true} #900#return; {35934#true} is VALID [2022-02-20 21:54:02,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {35934#true} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {35934#true} is VALID [2022-02-20 21:54:02,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {35934#true} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {35934#true} is VALID [2022-02-20 21:54:02,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {35934#true} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {35934#true} assume main_#t~switch165#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {35934#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {35934#true} assume !main_#t~switch174#1;main_#t~switch174#1 := main_#t~switch174#1 || 1 == main_~tmp___3~2#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {35934#true} assume main_#t~switch174#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {35934#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_eem_driver_init } true;havoc eem_driver_init_#res#1;havoc eem_driver_init_#t~ret156#1, eem_driver_init_~tmp~15#1;havoc eem_driver_init_~tmp~15#1;assume { :begin_inline_ldv_usb_register_driver_12 } true;ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 12, 0;havoc ldv_usb_register_driver_12_#res#1;havoc ldv_usb_register_driver_12_#t~ret186#1, ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset, ldv_usb_register_driver_12_~ldv_func_res~0#1, ldv_usb_register_driver_12_~tmp~19#1;ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_12_~ldv_func_res~0#1;havoc ldv_usb_register_driver_12_~tmp~19#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet210#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet210#1 && usb_register_driver_#t~nondet210#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet210#1;havoc usb_register_driver_#t~nondet210#1; {35934#true} is VALID [2022-02-20 21:54:02,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {35934#true} ldv_usb_register_driver_12_#t~ret186#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_12_#t~ret186#1 && ldv_usb_register_driver_12_#t~ret186#1 <= 2147483647;ldv_usb_register_driver_12_~tmp~19#1 := ldv_usb_register_driver_12_#t~ret186#1;havoc ldv_usb_register_driver_12_#t~ret186#1;ldv_usb_register_driver_12_~ldv_func_res~0#1 := ldv_usb_register_driver_12_~tmp~19#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset, ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset;havoc ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,636 INFO L272 TraceCheckUtils]: 36: Hoare triple {35934#true} call ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset := ldv_zalloc(1560); {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35934#true} {35934#true} #908#return; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {35934#true} ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset := ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {35934#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_12_#res#1 := ldv_usb_register_driver_12_~ldv_func_res~0#1; {35934#true} is VALID [2022-02-20 21:54:02,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {35934#true} eem_driver_init_#t~ret156#1 := ldv_usb_register_driver_12_#res#1;assume { :end_inline_ldv_usb_register_driver_12 } true;assume -2147483648 <= eem_driver_init_#t~ret156#1 && eem_driver_init_#t~ret156#1 <= 2147483647;eem_driver_init_~tmp~15#1 := eem_driver_init_#t~ret156#1;havoc eem_driver_init_#t~ret156#1;eem_driver_init_#res#1 := eem_driver_init_~tmp~15#1; {35934#true} is VALID [2022-02-20 21:54:02,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {35934#true} main_#t~ret175#1 := eem_driver_init_#res#1;assume { :end_inline_eem_driver_init } true;assume -2147483648 <= main_#t~ret175#1 && main_#t~ret175#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret175#1;havoc main_#t~ret175#1; {35934#true} is VALID [2022-02-20 21:54:02,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {35934#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset, ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset, ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,639 INFO L272 TraceCheckUtils]: 46: Hoare triple {35934#true} call ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset := ldv_zalloc(1472); {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,639 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {35934#true} {35934#true} #910#return; {35934#true} is VALID [2022-02-20 21:54:02,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {35934#true} ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset := ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;~eem_info_group0~0.base, ~eem_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,640 INFO L272 TraceCheckUtils]: 52: Hoare triple {35934#true} call ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset := ldv_zalloc(232); {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {36064#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {35934#true} is VALID [2022-02-20 21:54:02,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {35934#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,641 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {35934#true} {35934#true} #912#return; {35934#true} is VALID [2022-02-20 21:54:02,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {35934#true} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;havoc ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;~eem_info_group1~0.base, ~eem_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {35934#true} assume { :end_inline_ldv_initialize_driver_info_2 } true; {35934#true} is VALID [2022-02-20 21:54:02,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {35934#true} assume !(0 != ~ldv_retval_4~0); {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {35934#true} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {35934#true} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {35934#true} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 2 == main_~tmp___1~3#1; {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {35934#true} assume main_#t~switch165#1; {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {35934#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet176#1 && main_#t~nondet176#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet176#1;havoc main_#t~nondet176#1;main_#t~switch177#1 := 0 == main_~tmp___4~2#1; {35934#true} is VALID [2022-02-20 21:54:02,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {35934#true} assume main_#t~switch177#1; {35934#true} is VALID [2022-02-20 21:54:02,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {35934#true} assume 1 == ~ldv_state_variable_2~0; {35934#true} is VALID [2022-02-20 21:54:02,644 INFO L272 TraceCheckUtils]: 67: Hoare triple {35934#true} call main_#t~ret178#1 := eem_rx_fixup(~eem_info_group0~0.base, ~eem_info_group0~0.offset, ~eem_info_group1~0.base, ~eem_info_group1~0.offset); {36066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {36066#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {35934#true} is VALID [2022-02-20 21:54:02,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {35934#true} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35934#true} is VALID [2022-02-20 21:54:02,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {35934#true} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {35934#true} is VALID [2022-02-20 21:54:02,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {35934#true} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {35934#true} is VALID [2022-02-20 21:54:02,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {35934#true} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {35934#true} is VALID [2022-02-20 21:54:02,646 INFO L272 TraceCheckUtils]: 73: Hoare triple {35934#true} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,646 INFO L272 TraceCheckUtils]: 75: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,647 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35934#true} {35934#true} #856#return; {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {35934#true} havoc #t~ret124#1.base, #t~ret124#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {35934#true} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {35934#true} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {35934#true} is VALID [2022-02-20 21:54:02,648 INFO L290 TraceCheckUtils]: 86: Hoare triple {35934#true} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {35934#true} is VALID [2022-02-20 21:54:02,649 INFO L290 TraceCheckUtils]: 87: Hoare triple {35934#true} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {35934#true} is VALID [2022-02-20 21:54:02,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {35934#true} assume #t~switch130#1; {35934#true} is VALID [2022-02-20 21:54:02,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {35934#true} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {35934#true} is VALID [2022-02-20 21:54:02,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {35934#true} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35934#true} is VALID [2022-02-20 21:54:02,649 INFO L290 TraceCheckUtils]: 91: Hoare triple {35934#true} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {35934#true} is VALID [2022-02-20 21:54:02,650 INFO L272 TraceCheckUtils]: 92: Hoare triple {35934#true} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,650 INFO L290 TraceCheckUtils]: 93: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,651 INFO L272 TraceCheckUtils]: 94: Hoare triple {35934#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,652 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {35934#true} {35934#true} #852#return; {35934#true} is VALID [2022-02-20 21:54:02,652 INFO L290 TraceCheckUtils]: 99: Hoare triple {35934#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {35934#true} is VALID [2022-02-20 21:54:02,652 INFO L290 TraceCheckUtils]: 100: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,652 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35934#true} {35934#true} #860#return; {35934#true} is VALID [2022-02-20 21:54:02,652 INFO L290 TraceCheckUtils]: 102: Hoare triple {35934#true} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L272 TraceCheckUtils]: 103: Hoare triple {35934#true} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L290 TraceCheckUtils]: 104: Hoare triple {35934#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L290 TraceCheckUtils]: 105: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35934#true} {35934#true} #862#return; {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L290 TraceCheckUtils]: 107: Hoare triple {35934#true} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {35934#true} is VALID [2022-02-20 21:54:02,653 INFO L290 TraceCheckUtils]: 108: Hoare triple {35934#true} assume !(0 != ~tmp___0~4#1); {35934#true} is VALID [2022-02-20 21:54:02,654 INFO L272 TraceCheckUtils]: 109: Hoare triple {35934#true} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {35934#true} is VALID [2022-02-20 21:54:02,654 INFO L290 TraceCheckUtils]: 110: Hoare triple {35934#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,654 INFO L290 TraceCheckUtils]: 111: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,654 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {35934#true} {35934#true} #864#return; {35934#true} is VALID [2022-02-20 21:54:02,655 INFO L272 TraceCheckUtils]: 113: Hoare triple {35934#true} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,655 INFO L290 TraceCheckUtils]: 114: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,656 INFO L272 TraceCheckUtils]: 115: Hoare triple {35934#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,656 INFO L290 TraceCheckUtils]: 116: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,656 INFO L290 TraceCheckUtils]: 117: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,656 INFO L290 TraceCheckUtils]: 118: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,657 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {35934#true} {35934#true} #850#return; {35934#true} is VALID [2022-02-20 21:54:02,657 INFO L290 TraceCheckUtils]: 120: Hoare triple {35934#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {35934#true} is VALID [2022-02-20 21:54:02,657 INFO L290 TraceCheckUtils]: 121: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,657 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {35934#true} {35934#true} #866#return; {35934#true} is VALID [2022-02-20 21:54:02,657 INFO L290 TraceCheckUtils]: 123: Hoare triple {35934#true} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,658 INFO L272 TraceCheckUtils]: 124: Hoare triple {35934#true} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:02,658 INFO L290 TraceCheckUtils]: 125: Hoare triple {36065#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {35934#true} is VALID [2022-02-20 21:54:02,659 INFO L290 TraceCheckUtils]: 126: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,659 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {35934#true} {35934#true} #868#return; {35934#true} is VALID [2022-02-20 21:54:02,659 INFO L290 TraceCheckUtils]: 128: Hoare triple {35934#true} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {35934#true} is VALID [2022-02-20 21:54:02,660 INFO L272 TraceCheckUtils]: 129: Hoare triple {35934#true} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,660 INFO L290 TraceCheckUtils]: 130: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,660 INFO L290 TraceCheckUtils]: 131: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,660 INFO L290 TraceCheckUtils]: 132: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,660 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {35934#true} {35934#true} #870#return; {35934#true} is VALID [2022-02-20 21:54:02,661 INFO L290 TraceCheckUtils]: 134: Hoare triple {35934#true} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,661 INFO L290 TraceCheckUtils]: 135: Hoare triple {35934#true} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {35934#true} is VALID [2022-02-20 21:54:02,661 INFO L290 TraceCheckUtils]: 136: Hoare triple {35934#true} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {35934#true} is VALID [2022-02-20 21:54:02,662 INFO L272 TraceCheckUtils]: 137: Hoare triple {35934#true} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,662 INFO L290 TraceCheckUtils]: 138: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {35934#true} is VALID [2022-02-20 21:54:02,663 INFO L272 TraceCheckUtils]: 139: Hoare triple {35934#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:02,664 INFO L290 TraceCheckUtils]: 140: Hoare triple {36142#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,664 INFO L290 TraceCheckUtils]: 141: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,665 INFO L290 TraceCheckUtils]: 142: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~1 < ~last_index~0); {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:54:02,665 INFO L290 TraceCheckUtils]: 143: Hoare triple {36152#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {35935#false} is VALID [2022-02-20 21:54:02,665 INFO L290 TraceCheckUtils]: 144: Hoare triple {35935#false} assume !false; {35935#false} is VALID [2022-02-20 21:54:02,665 INFO L290 TraceCheckUtils]: 145: Hoare triple {35935#false} assume !(~i~1 < ~last_index~0); {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L290 TraceCheckUtils]: 146: Hoare triple {35935#false} ~last_index~0 := ~last_index~0 - 1; {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L290 TraceCheckUtils]: 147: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {35935#false} {35934#true} #854#return; {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L290 TraceCheckUtils]: 149: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {35935#false} {35934#true} #874#return; {35935#false} is VALID [2022-02-20 21:54:02,666 INFO L290 TraceCheckUtils]: 151: Hoare triple {35935#false} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,667 INFO L290 TraceCheckUtils]: 152: Hoare triple {35935#false} assume { :end_inline_eem_linkcmd } true; {35935#false} is VALID [2022-02-20 21:54:02,667 INFO L272 TraceCheckUtils]: 153: Hoare triple {35935#false} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,667 INFO L290 TraceCheckUtils]: 154: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {35934#true} is VALID [2022-02-20 21:54:02,668 INFO L272 TraceCheckUtils]: 155: Hoare triple {35934#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:02,668 INFO L290 TraceCheckUtils]: 156: Hoare triple {36129#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {35934#true} is VALID [2022-02-20 21:54:02,668 INFO L290 TraceCheckUtils]: 157: Hoare triple {35934#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {35934#true} is VALID [2022-02-20 21:54:02,668 INFO L290 TraceCheckUtils]: 158: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,668 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {35934#true} {35934#true} #848#return; {35934#true} is VALID [2022-02-20 21:54:02,669 INFO L290 TraceCheckUtils]: 160: Hoare triple {35934#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {35934#true} is VALID [2022-02-20 21:54:02,669 INFO L290 TraceCheckUtils]: 161: Hoare triple {35934#true} assume true; {35934#true} is VALID [2022-02-20 21:54:02,669 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35934#true} {35935#false} #888#return; {35935#false} is VALID [2022-02-20 21:54:02,669 INFO L290 TraceCheckUtils]: 163: Hoare triple {35935#false} havoc #t~ret154#1.base, #t~ret154#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,669 INFO L290 TraceCheckUtils]: 164: Hoare triple {35935#false} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {35935#false} is VALID [2022-02-20 21:54:02,669 INFO L290 TraceCheckUtils]: 165: Hoare triple {35935#false} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 166: Hoare triple {35935#false} assume true; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35935#false} {35934#true} #916#return; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 168: Hoare triple {35935#false} assume -2147483648 <= main_#t~ret178#1 && main_#t~ret178#1 <= 2147483647;havoc main_#t~ret178#1;~ldv_state_variable_2~0 := 1; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 169: Hoare triple {35935#false} assume !(2 == ~ldv_state_variable_2~0); {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 170: Hoare triple {35935#false} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 171: Hoare triple {35935#false} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {35935#false} is VALID [2022-02-20 21:54:02,670 INFO L290 TraceCheckUtils]: 172: Hoare triple {35935#false} assume main_#t~switch165#1; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 173: Hoare triple {35935#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 174: Hoare triple {35935#false} assume main_#t~switch174#1; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 175: Hoare triple {35935#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_eem_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_13 } true;ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset;havoc ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset := ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 176: Hoare triple {35935#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 177: Hoare triple {35935#false} assume { :end_inline_ldv_usb_deregister_13 } true; {35935#false} is VALID [2022-02-20 21:54:02,671 INFO L290 TraceCheckUtils]: 178: Hoare triple {35935#false} assume { :end_inline_eem_driver_exit } true;~ldv_state_variable_0~0 := 2; {35935#false} is VALID [2022-02-20 21:54:02,672 INFO L290 TraceCheckUtils]: 179: Hoare triple {35935#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {35935#false} is VALID [2022-02-20 21:54:02,672 INFO L290 TraceCheckUtils]: 180: Hoare triple {35935#false} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {35935#false} is VALID [2022-02-20 21:54:02,672 INFO L290 TraceCheckUtils]: 181: Hoare triple {35935#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {35935#false} is VALID [2022-02-20 21:54:02,672 INFO L272 TraceCheckUtils]: 182: Hoare triple {35935#false} call ldv_error(); {35935#false} is VALID [2022-02-20 21:54:02,672 INFO L290 TraceCheckUtils]: 183: Hoare triple {35935#false} assume !false; {35935#false} is VALID [2022-02-20 21:54:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-02-20 21:54:02,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:02,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280016633] [2022-02-20 21:54:02,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280016633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:02,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:02,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:54:02,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125402802] [2022-02-20 21:54:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2022-02-20 21:54:02,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:02,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 21:54:02,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:02,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:54:02,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:54:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:54:02,815 INFO L87 Difference]: Start difference. First operand 2556 states and 3460 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 21:54:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:09,106 INFO L93 Difference]: Finished difference Result 4500 states and 6218 transitions. [2022-02-20 21:54:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:54:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 184 [2022-02-20 21:54:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 21:54:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2022-02-20 21:54:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 21:54:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 937 transitions. [2022-02-20 21:54:09,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 937 transitions. [2022-02-20 21:54:09,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 937 edges. 937 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:10,286 INFO L225 Difference]: With dead ends: 4500 [2022-02-20 21:54:10,286 INFO L226 Difference]: Without dead ends: 3069 [2022-02-20 21:54:10,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:54:10,291 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 347 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:54:10,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1459 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 21:54:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-02-20 21:54:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2564. [2022-02-20 21:54:10,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:54:10,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3069 states. Second operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:10,382 INFO L74 IsIncluded]: Start isIncluded. First operand 3069 states. Second operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:10,385 INFO L87 Difference]: Start difference. First operand 3069 states. Second operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:10,638 INFO L93 Difference]: Finished difference Result 3069 states and 4238 transitions. [2022-02-20 21:54:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4238 transitions. [2022-02-20 21:54:10,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:10,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:10,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) Second operand 3069 states. [2022-02-20 21:54:10,654 INFO L87 Difference]: Start difference. First operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) Second operand 3069 states. [2022-02-20 21:54:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:10,970 INFO L93 Difference]: Finished difference Result 3069 states and 4238 transitions. [2022-02-20 21:54:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 4238 transitions. [2022-02-20 21:54:10,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:54:10,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:54:10,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:54:10,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:54:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2122 states have (on average 1.3557964184731386) internal successors, (2877), 2146 states have internal predecessors, (2877), 284 states have call successors, (284), 146 states have call predecessors, (284), 157 states have return successors, (307), 287 states have call predecessors, (307), 283 states have call successors, (307) [2022-02-20 21:54:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3468 transitions. [2022-02-20 21:54:11,340 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3468 transitions. Word has length 184 [2022-02-20 21:54:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:54:11,340 INFO L470 AbstractCegarLoop]: Abstraction has 2564 states and 3468 transitions. [2022-02-20 21:54:11,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-02-20 21:54:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3468 transitions. [2022-02-20 21:54:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-02-20 21:54:11,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:11,346 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:54:11,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:54:11,347 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1475470648, now seen corresponding path program 1 times [2022-02-20 21:54:11,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:11,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684410046] [2022-02-20 21:54:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #894#return; {51574#true} is VALID [2022-02-20 21:54:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #896#return; {51574#true} is VALID [2022-02-20 21:54:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:54:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {51574#true} is VALID [2022-02-20 21:54:11,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {51574#true} is VALID [2022-02-20 21:54:11,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {51574#true} is VALID [2022-02-20 21:54:11,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #898#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:54:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {51574#true} is VALID [2022-02-20 21:54:11,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {51574#true} is VALID [2022-02-20 21:54:11,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {51574#true} is VALID [2022-02-20 21:54:11,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #900#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:54:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #908#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:54:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #910#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:54:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #912#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:54:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 21:54:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,722 INFO L272 TraceCheckUtils]: 1: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,723 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:11,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,724 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #856#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 21:54:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #852#return; {51574#true} is VALID [2022-02-20 21:54:11,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,738 INFO L272 TraceCheckUtils]: 1: Hoare triple {51574#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,739 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {51574#true} {51574#true} #852#return; {51574#true} is VALID [2022-02-20 21:54:11,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {51574#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {51574#true} is VALID [2022-02-20 21:54:11,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,740 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #860#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 21:54:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {51574#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {51574#true} is VALID [2022-02-20 21:54:11,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #862#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:54:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {51574#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #864#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:54:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #850#return; {51574#true} is VALID [2022-02-20 21:54:11,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,765 INFO L272 TraceCheckUtils]: 1: Hoare triple {51574#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,766 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {51574#true} {51574#true} #850#return; {51574#true} is VALID [2022-02-20 21:54:11,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {51574#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {51574#true} is VALID [2022-02-20 21:54:11,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,767 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #866#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:54:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {51574#true} is VALID [2022-02-20 21:54:11,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #868#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:54:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #870#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-02-20 21:54:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem188.base, #t~mem188.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem188.base + #t~mem188.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem188.base, #t~mem188.offset;~deleted_index~0 := ~i~1; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #854#return; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,869 INFO L272 TraceCheckUtils]: 1: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem188.base, #t~mem188.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem188.base + #t~mem188.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem188.base, #t~mem188.offset;~deleted_index~0 := ~i~1; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,874 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #854#return; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,875 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #874#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-02-20 21:54:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:54:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:11,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,891 INFO L272 TraceCheckUtils]: 1: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,891 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:11,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,893 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {51574#true} {51766#(not (= |old(~last_index~0)| 0))} #888#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {51709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,907 INFO L272 TraceCheckUtils]: 5: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,908 INFO L272 TraceCheckUtils]: 7: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,909 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:11,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,910 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #856#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} havoc #t~ret124#1.base, #t~ret124#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch130#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,914 INFO L272 TraceCheckUtils]: 24: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L272 TraceCheckUtils]: 26: Hoare triple {51574#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {51574#true} {51574#true} #852#return; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {51574#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {51574#true} is VALID [2022-02-20 21:54:11,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,916 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #860#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,917 INFO L272 TraceCheckUtils]: 35: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {51574#true} is VALID [2022-02-20 21:54:11,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {51574#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {51574#true} is VALID [2022-02-20 21:54:11,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,918 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #862#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(0 != ~tmp___0~4#1); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,919 INFO L272 TraceCheckUtils]: 41: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {51574#true} is VALID [2022-02-20 21:54:11,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {51574#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,920 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #864#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,920 INFO L272 TraceCheckUtils]: 45: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,921 INFO L272 TraceCheckUtils]: 47: Hoare triple {51574#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,922 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {51574#true} {51574#true} #850#return; {51574#true} is VALID [2022-02-20 21:54:11,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {51574#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {51574#true} is VALID [2022-02-20 21:54:11,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,923 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #866#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,924 INFO L272 TraceCheckUtils]: 56: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:11,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {51574#true} is VALID [2022-02-20 21:54:11,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,925 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #868#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,926 INFO L272 TraceCheckUtils]: 61: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,927 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #870#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,928 INFO L290 TraceCheckUtils]: 68: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,929 INFO L272 TraceCheckUtils]: 69: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,929 INFO L290 TraceCheckUtils]: 70: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,930 INFO L272 TraceCheckUtils]: 71: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,931 INFO L290 TraceCheckUtils]: 72: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem188.base, #t~mem188.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,933 INFO L290 TraceCheckUtils]: 76: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem188.base + #t~mem188.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem188.base, #t~mem188.offset;~deleted_index~0 := ~i~1; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,936 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #854#return; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:11,937 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #874#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,938 INFO L290 TraceCheckUtils]: 85: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,938 INFO L290 TraceCheckUtils]: 86: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume { :end_inline_eem_linkcmd } true; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,939 INFO L272 TraceCheckUtils]: 87: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,939 INFO L290 TraceCheckUtils]: 88: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,940 INFO L272 TraceCheckUtils]: 89: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,940 INFO L290 TraceCheckUtils]: 92: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,940 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:11,941 INFO L290 TraceCheckUtils]: 95: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,941 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {51574#true} {51766#(not (= |old(~last_index~0)| 0))} #888#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} havoc #t~ret154#1.base, #t~ret154#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,942 INFO L290 TraceCheckUtils]: 98: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume true; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:11,944 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {51766#(not (= |old(~last_index~0)| 0))} {51584#(= ~last_index~0 0)} #916#return; {51575#false} is VALID [2022-02-20 21:54:11,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {51574#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(100, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(8, 4);call #Ultimate.allocInit(13, 5);call #Ultimate.allocInit(222, 6);call #Ultimate.allocInit(23, 7);call #Ultimate.allocInit(23, 8);call #Ultimate.allocInit(28, 9);call #Ultimate.allocInit(15, 10);call #Ultimate.allocInit(8, 11);call #Ultimate.allocInit(8, 12);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~eem_info_group1~0.base, ~eem_info_group1~0.offset := 0, 0;~usb_counter~0 := 0;~eem_info_group0~0.base, ~eem_info_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#eem_info~0.base, ~#eem_info~0.offset := 13, 0;call #Ultimate.allocInit(124, 13);call write~init~$Pointer$(10, 0, ~#eem_info~0.base, ~#eem_info~0.offset, 8);call write~init~int(4128, ~#eem_info~0.base, 8 + ~#eem_info~0.offset, 4);call write~init~$Pointer$(#funAddr~eem_bind.base, #funAddr~eem_bind.offset, ~#eem_info~0.base, 12 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 20 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 28 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 36 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 44 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 52 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 60 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 68 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_rx_fixup.base, #funAddr~eem_rx_fixup.offset, ~#eem_info~0.base, 76 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(#funAddr~eem_tx_fixup.base, #funAddr~eem_tx_fixup.offset, ~#eem_info~0.base, 84 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 92 + ~#eem_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_info~0.base, 100 + ~#eem_info~0.offset, 8);call write~init~int(0, ~#eem_info~0.base, 108 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 112 + ~#eem_info~0.offset, 4);call write~init~int(0, ~#eem_info~0.base, 116 + ~#eem_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 14, 0;call #Ultimate.allocInit(50, 14);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(896, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(2, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(12, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(7, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#eem_info~0.base + ~#eem_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#eem_driver~0.base, ~#eem_driver~0.offset := 15, 0;call #Ultimate.allocInit(285, 15);call write~init~$Pointer$(11, 0, ~#eem_driver~0.base, ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#eem_driver~0.base, 8 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#eem_driver~0.base, 16 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 24 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#eem_driver~0.base, 32 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#eem_driver~0.base, 40 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 48 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 56 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 64 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#eem_driver~0.base, 72 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 80 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 84 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 88 + ~#eem_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 92 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 100 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 108 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 116 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 124 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 132 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 136 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 148 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 156 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 164 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 172 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 180 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 188 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 196 + ~#eem_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 197 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 205 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 213 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 221 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 229 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 237 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 245 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 253 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 261 + ~#eem_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#eem_driver~0.base, 269 + ~#eem_driver~0.offset, 8);call write~init~int(0, ~#eem_driver~0.base, 277 + ~#eem_driver~0.offset, 4);call write~init~int(0, ~#eem_driver~0.base, 281 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 282 + ~#eem_driver~0.offset, 1);call write~init~int(1, ~#eem_driver~0.base, 283 + ~#eem_driver~0.offset, 1);call write~init~int(0, ~#eem_driver~0.base, 284 + ~#eem_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 16, 0;call #Ultimate.allocInit(120, 16);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {51574#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset, main_#t~ret161#1.base, main_#t~ret161#1.offset, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~mem169#1, main_#t~ret170#1, main_#t~ret171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~ret175#1, main_#t~nondet176#1, main_#t~switch177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~mem181#1, main_#t~ret182#1.base, main_#t~ret182#1.offset, main_#t~mem183#1, main_#t~ret184#1.base, main_#t~ret184#1.offset, main_#t~ret185#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~18#1.base, main_~tmp~18#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___1~3#1, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~18#1.base, main_~tmp~18#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~3#1;havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1; {51574#true} is VALID [2022-02-20 21:54:11,946 INFO L272 TraceCheckUtils]: 2: Hoare triple {51574#true} call main_#t~ret160#1.base, main_#t~ret160#1.offset := ldv_zalloc(32); {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,946 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {51574#true} {51574#true} #894#return; {51574#true} is VALID [2022-02-20 21:54:11,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {51574#true} main_~tmp~18#1.base, main_~tmp~18#1.offset := main_#t~ret160#1.base, main_#t~ret160#1.offset;havoc main_#t~ret160#1.base, main_#t~ret160#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~18#1.base, main_~tmp~18#1.offset; {51574#true} is VALID [2022-02-20 21:54:11,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {51574#true} call main_#t~ret161#1.base, main_#t~ret161#1.offset := ldv_zalloc(1560); {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,948 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {51574#true} {51574#true} #896#return; {51574#true} is VALID [2022-02-20 21:54:11,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {51574#true} main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset := main_#t~ret161#1.base, main_#t~ret161#1.offset;havoc main_#t~ret161#1.base, main_#t~ret161#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~6#1.base, main_~tmp___0~6#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {51584#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {51584#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,949 INFO L272 TraceCheckUtils]: 16: Hoare triple {51584#(= ~last_index~0 0)} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:11,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {51574#true} is VALID [2022-02-20 21:54:11,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {51574#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {51574#true} is VALID [2022-02-20 21:54:11,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {51574#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {51574#true} is VALID [2022-02-20 21:54:11,951 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #898#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {51584#(= ~last_index~0 0)} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,952 INFO L272 TraceCheckUtils]: 22: Hoare triple {51584#(= ~last_index~0 0)} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:11,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr218 := 0; {51574#true} is VALID [2022-02-20 21:54:11,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {51574#true} assume !(#t~loopctr218 % 18446744073709551616 < #amount % 18446744073709551616); {51574#true} is VALID [2022-02-20 21:54:11,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {51574#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {51574#true} is VALID [2022-02-20 21:54:11,953 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #900#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {51584#(= ~last_index~0 0)} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {51584#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {51584#(= ~last_index~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {51584#(= ~last_index~0 0)} assume main_#t~switch165#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {51584#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {51584#(= ~last_index~0 0)} assume !main_#t~switch174#1;main_#t~switch174#1 := main_#t~switch174#1 || 1 == main_~tmp___3~2#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {51584#(= ~last_index~0 0)} assume main_#t~switch174#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {51584#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_eem_driver_init } true;havoc eem_driver_init_#res#1;havoc eem_driver_init_#t~ret156#1, eem_driver_init_~tmp~15#1;havoc eem_driver_init_~tmp~15#1;assume { :begin_inline_ldv_usb_register_driver_12 } true;ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 12, 0;havoc ldv_usb_register_driver_12_#res#1;havoc ldv_usb_register_driver_12_#t~ret186#1, ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset, ldv_usb_register_driver_12_~ldv_func_res~0#1, ldv_usb_register_driver_12_~tmp~19#1;ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset := ldv_usb_register_driver_12_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_12_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_12_~ldv_func_res~0#1;havoc ldv_usb_register_driver_12_~tmp~19#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_12_~ldv_func_arg1#1.base, ldv_usb_register_driver_12_~ldv_func_arg1#1.offset, ldv_usb_register_driver_12_~ldv_func_arg2#1.base, ldv_usb_register_driver_12_~ldv_func_arg2#1.offset, ldv_usb_register_driver_12_~ldv_func_arg3#1.base, ldv_usb_register_driver_12_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet210#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet210#1 && usb_register_driver_#t~nondet210#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet210#1;havoc usb_register_driver_#t~nondet210#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {51584#(= ~last_index~0 0)} ldv_usb_register_driver_12_#t~ret186#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_12_#t~ret186#1 && ldv_usb_register_driver_12_#t~ret186#1 <= 2147483647;ldv_usb_register_driver_12_~tmp~19#1 := ldv_usb_register_driver_12_#t~ret186#1;havoc ldv_usb_register_driver_12_#t~ret186#1;ldv_usb_register_driver_12_~ldv_func_res~0#1 := ldv_usb_register_driver_12_~tmp~19#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset, ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset;havoc ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,957 INFO L272 TraceCheckUtils]: 36: Hoare triple {51584#(= ~last_index~0 0)} call ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset := ldv_zalloc(1560); {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,958 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #908#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {51584#(= ~last_index~0 0)} ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset := ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;havoc ldv_usb_driver_1_#t~ret159#1.base, ldv_usb_driver_1_#t~ret159#1.offset;~eem_driver_group1~0.base, ~eem_driver_group1~0.offset := ldv_usb_driver_1_~tmp~17#1.base, ldv_usb_driver_1_~tmp~17#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {51584#(= ~last_index~0 0)} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_12_#res#1 := ldv_usb_register_driver_12_~ldv_func_res~0#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {51584#(= ~last_index~0 0)} eem_driver_init_#t~ret156#1 := ldv_usb_register_driver_12_#res#1;assume { :end_inline_ldv_usb_register_driver_12 } true;assume -2147483648 <= eem_driver_init_#t~ret156#1 && eem_driver_init_#t~ret156#1 <= 2147483647;eem_driver_init_~tmp~15#1 := eem_driver_init_#t~ret156#1;havoc eem_driver_init_#t~ret156#1;eem_driver_init_#res#1 := eem_driver_init_~tmp~15#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {51584#(= ~last_index~0 0)} main_#t~ret175#1 := eem_driver_init_#res#1;assume { :end_inline_eem_driver_init } true;assume -2147483648 <= main_#t~ret175#1 && main_#t~ret175#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret175#1;havoc main_#t~ret175#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {51584#(= ~last_index~0 0)} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset, ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset, ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,961 INFO L272 TraceCheckUtils]: 46: Hoare triple {51584#(= ~last_index~0 0)} call ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset := ldv_zalloc(1472); {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,961 INFO L290 TraceCheckUtils]: 47: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,962 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #910#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {51584#(= ~last_index~0 0)} ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset := ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;havoc ldv_initialize_driver_info_2_#t~ret157#1.base, ldv_initialize_driver_info_2_#t~ret157#1.offset;~eem_info_group0~0.base, ~eem_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~16#1.base, ldv_initialize_driver_info_2_~tmp~16#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,963 INFO L272 TraceCheckUtils]: 52: Hoare triple {51584#(= ~last_index~0 0)} call ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset := ldv_zalloc(232); {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {51707#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet49#1 && #t~nondet49#1 <= 2147483647;~tmp___0~2#1 := #t~nondet49#1;havoc #t~nondet49#1; {51574#true} is VALID [2022-02-20 21:54:11,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {51574#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,964 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {51574#true} {51584#(= ~last_index~0 0)} #912#return; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {51584#(= ~last_index~0 0)} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;havoc ldv_initialize_driver_info_2_#t~ret158#1.base, ldv_initialize_driver_info_2_#t~ret158#1.offset;~eem_info_group1~0.base, ~eem_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {51584#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize_driver_info_2 } true; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {51584#(= ~last_index~0 0)} assume !(0 != ~ldv_retval_4~0); {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {51584#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {51584#(= ~last_index~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {51584#(= ~last_index~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 2 == main_~tmp___1~3#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {51584#(= ~last_index~0 0)} assume main_#t~switch165#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {51584#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet176#1 && main_#t~nondet176#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet176#1;havoc main_#t~nondet176#1;main_#t~switch177#1 := 0 == main_~tmp___4~2#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {51584#(= ~last_index~0 0)} assume main_#t~switch177#1; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {51584#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_2~0; {51584#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:11,969 INFO L272 TraceCheckUtils]: 67: Hoare triple {51584#(= ~last_index~0 0)} call main_#t~ret178#1 := eem_rx_fixup(~eem_info_group0~0.base, ~eem_info_group0~0.offset, ~eem_info_group1~0.base, ~eem_info_group1~0.offset); {51709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {51709#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5969)| abs_5969) (= |old(abs_6008)| abs_6008) (= |old(#valid)| |#valid|) (= |old(abs_5972)| abs_5972) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~skb2~1#1.base, ~skb2~1#1.offset;havoc ~header~0#1;havoc ~len~1#1;havoc ~bmEEMCmd~0#1;call ~#descriptor~0#1.base, ~#descriptor~0#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp~14#1;havoc ~tmp___0~4#1;havoc ~tmp___1~2#1.base, ~tmp___1~2#1.offset;havoc ~crc~1#1;havoc ~crc2~0#1;havoc ~is_last~0#1;havoc ~tmp___2~1#1;havoc ~tmp___3~1#1;havoc ~tmp___4~1#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~skb2~1#1.base, ~skb2~1#1.offset := 0, 0;~len~1#1 := 0;call #t~mem121#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(#t~mem121#1 % 4294967296 <= 1);havoc #t~mem121#1;call #t~mem122#1.base, #t~mem122#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);assume { :begin_inline_get_unaligned_le16 } true;get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset := #t~mem122#1.base, #t~mem122#1.offset;havoc get_unaligned_le16_#res#1;havoc get_unaligned_le16_#t~ret57#1, get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset, get_unaligned_le16_~tmp~9#1;get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset := get_unaligned_le16_#in~p#1.base, get_unaligned_le16_#in~p#1.offset;havoc get_unaligned_le16_~tmp~9#1;assume { :begin_inline___le16_to_cpup } true;__le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset := get_unaligned_le16_~p#1.base, get_unaligned_le16_~p#1.offset;havoc __le16_to_cpup_#res#1;havoc __le16_to_cpup_#t~mem5#1, __le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset;__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset := __le16_to_cpup_#in~p#1.base, __le16_to_cpup_#in~p#1.offset;call __le16_to_cpup_#t~mem5#1 := read~int(__le16_to_cpup_~p#1.base, __le16_to_cpup_~p#1.offset, 2);__le16_to_cpup_#res#1 := __le16_to_cpup_#t~mem5#1;havoc __le16_to_cpup_#t~mem5#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,970 INFO L290 TraceCheckUtils]: 71: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} get_unaligned_le16_#t~ret57#1 := __le16_to_cpup_#res#1;assume { :end_inline___le16_to_cpup } true;get_unaligned_le16_~tmp~9#1 := get_unaligned_le16_#t~ret57#1;havoc get_unaligned_le16_#t~ret57#1;get_unaligned_le16_#res#1 := get_unaligned_le16_~tmp~9#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} #t~ret123#1 := get_unaligned_le16_#res#1;assume { :end_inline_get_unaligned_le16 } true;~header~0#1 := #t~ret123#1;havoc #t~mem122#1.base, #t~mem122#1.offset;havoc #t~ret123#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,971 INFO L272 TraceCheckUtils]: 73: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret124#1.base, #t~ret124#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,972 INFO L272 TraceCheckUtils]: 75: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,972 INFO L290 TraceCheckUtils]: 76: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,972 INFO L290 TraceCheckUtils]: 77: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,973 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:11,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:11,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,974 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #856#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} havoc #t~ret124#1.base, #t~ret124#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume (if ~header~0#1 % 65536 % 65536 <= 32767 then ~header~0#1 % 65536 % 65536 else ~header~0#1 % 65536 % 65536 - 65536) < 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(0 != (if 0 == ~header~0#1 % 65536 then 0 else (if 1 == ~header~0#1 % 65536 then 0 else ~bitwiseAnd(~header~0#1 % 65536, 16384))) % 18446744073709551616); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == ~header~0#1 % 65536 / 2048 % 65536;~bmEEMCmd~0#1 := 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} #t~switch130#1 := 0 == ~bmEEMCmd~0#1 % 65536; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume #t~switch130#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == ~header~0#1 % 65536;~len~1#1 := 0; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,977 INFO L290 TraceCheckUtils]: 90: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~mem132#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,977 INFO L290 TraceCheckUtils]: 91: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(#t~mem132#1 % 4294967296 < ~len~1#1 % 65536 % 4294967296);havoc #t~mem132#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,978 INFO L272 TraceCheckUtils]: 92: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret133#1.base, #t~ret133#1.offset := skb_clone(~skb#1.base, ~skb#1.offset, 32); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,978 INFO L290 TraceCheckUtils]: 93: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L272 TraceCheckUtils]: 94: Hoare triple {51574#true} call #t~ret202.base, #t~ret202.offset := ldv_malloc(248); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,979 INFO L290 TraceCheckUtils]: 95: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L290 TraceCheckUtils]: 96: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {51574#true} {51574#true} #852#return; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {51574#true} #res.base, #res.offset := #t~ret202.base, #t~ret202.offset;havoc #t~ret202.base, #t~ret202.offset; {51574#true} is VALID [2022-02-20 21:54:11,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,980 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #860#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,981 INFO L290 TraceCheckUtils]: 102: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~skb2~1#1.base, ~skb2~1#1.offset := #t~ret133#1.base, #t~ret133#1.offset;havoc #t~ret133#1.base, #t~ret133#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,981 INFO L272 TraceCheckUtils]: 103: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret134#1 := ldv__builtin_expect((if 0 == (~skb2~1#1.base + ~skb2~1#1.offset) % 18446744073709551616 then 1 else 0), 0); {51574#true} is VALID [2022-02-20 21:54:11,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {51574#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {51574#true} is VALID [2022-02-20 21:54:11,981 INFO L290 TraceCheckUtils]: 105: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,983 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #862#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,983 INFO L290 TraceCheckUtils]: 107: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume -9223372036854775808 <= #t~ret134#1 && #t~ret134#1 <= 9223372036854775807;~tmp___0~4#1 := #t~ret134#1;havoc #t~ret134#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,983 INFO L290 TraceCheckUtils]: 108: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume !(0 != ~tmp___0~4#1); {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,984 INFO L272 TraceCheckUtils]: 109: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call skb_trim(~skb2~1#1.base, ~skb2~1#1.offset, ~len~1#1 % 65536); {51574#true} is VALID [2022-02-20 21:54:11,984 INFO L290 TraceCheckUtils]: 110: Hoare triple {51574#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,984 INFO L290 TraceCheckUtils]: 111: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,985 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #864#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,986 INFO L272 TraceCheckUtils]: 113: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call #t~ret135#1.base, #t~ret135#1.offset := skb_push(~skb2~1#1.base, ~skb2~1#1.offset, 2); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,986 INFO L290 TraceCheckUtils]: 114: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:11,986 INFO L272 TraceCheckUtils]: 115: Hoare triple {51574#true} call #t~ret205.base, #t~ret205.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,986 INFO L290 TraceCheckUtils]: 116: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,987 INFO L290 TraceCheckUtils]: 117: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,987 INFO L290 TraceCheckUtils]: 118: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,987 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {51574#true} {51574#true} #850#return; {51574#true} is VALID [2022-02-20 21:54:11,987 INFO L290 TraceCheckUtils]: 120: Hoare triple {51574#true} #res.base, #res.offset := #t~ret205.base, #t~ret205.offset;havoc #t~ret205.base, #t~ret205.offset; {51574#true} is VALID [2022-02-20 21:54:11,987 INFO L290 TraceCheckUtils]: 121: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,988 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #866#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,988 INFO L290 TraceCheckUtils]: 123: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} ~tmp___1~2#1.base, ~tmp___1~2#1.offset := #t~ret135#1.base, #t~ret135#1.offset;havoc #t~ret135#1.base, #t~ret135#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,989 INFO L272 TraceCheckUtils]: 124: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call put_unaligned_le16((if ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 else ~bitwiseOr(~len~1#1 % 65536, 34816) % 4294967296 % 4294967296 - 4294967296), ~tmp___1~2#1.base, ~tmp___1~2#1.offset); {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:54:11,990 INFO L290 TraceCheckUtils]: 125: Hoare triple {51708#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~val := #in~val;~p.base, ~p.offset := #in~p.base, #in~p.offset;call write~int(~val, ~p.base, ~p.offset, 2); {51574#true} is VALID [2022-02-20 21:54:11,990 INFO L290 TraceCheckUtils]: 126: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,990 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #868#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,991 INFO L290 TraceCheckUtils]: 128: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume { :begin_inline_eem_linkcmd } true;eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset, eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset := ~dev#1.base, ~dev#1.offset, ~skb2~1#1.base, ~skb2~1#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset, eem_linkcmd_#t~mem88#1.base, eem_linkcmd_#t~mem88#1.offset, eem_linkcmd_#t~mem89#1, eem_linkcmd_#t~mem90#1.base, eem_linkcmd_#t~mem90#1.offset, eem_linkcmd_#t~mem91#1, eem_linkcmd_#t~ret92#1, eem_linkcmd_#t~nondet93#1, eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset, eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset, eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset, eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset, eem_linkcmd_~status~0#1;eem_linkcmd_~dev#1.base, eem_linkcmd_~dev#1.offset := eem_linkcmd_#in~dev#1.base, eem_linkcmd_#in~dev#1.offset;eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset := eem_linkcmd_#in~skb#1.base, eem_linkcmd_#in~skb#1.offset;havoc eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset;havoc eem_linkcmd_~status~0#1;assume { :begin_inline_usb_alloc_urb } true;usb_alloc_urb_#in~arg0#1, usb_alloc_urb_#in~arg1#1 := 0, 32;havoc usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset, usb_alloc_urb_~arg0#1, usb_alloc_urb_~arg1#1;usb_alloc_urb_~arg0#1 := usb_alloc_urb_#in~arg0#1;usb_alloc_urb_~arg1#1 := usb_alloc_urb_#in~arg1#1; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,991 INFO L272 TraceCheckUtils]: 129: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset := ldv_malloc(184); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:11,991 INFO L290 TraceCheckUtils]: 130: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:11,992 INFO L290 TraceCheckUtils]: 131: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:11,992 INFO L290 TraceCheckUtils]: 132: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:11,992 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {51574#true} {51710#(= |old(~last_index~0)| ~last_index~0)} #870#return; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,993 INFO L290 TraceCheckUtils]: 134: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset := usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset;havoc usb_alloc_urb_#t~ret209#1.base, usb_alloc_urb_#t~ret209#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,993 INFO L290 TraceCheckUtils]: 135: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset := usb_alloc_urb_#res#1.base, usb_alloc_urb_#res#1.offset;assume { :end_inline_usb_alloc_urb } true;eem_linkcmd_~urb~0#1.base, eem_linkcmd_~urb~0#1.offset := eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset;havoc eem_linkcmd_#t~ret87#1.base, eem_linkcmd_#t~ret87#1.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,993 INFO L290 TraceCheckUtils]: 136: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} assume 0 == (eem_linkcmd_~urb~0#1.base + eem_linkcmd_~urb~0#1.offset) % 18446744073709551616; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,994 INFO L272 TraceCheckUtils]: 137: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call ldv_skb_free(eem_linkcmd_~skb#1.base, eem_linkcmd_~skb#1.offset); {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,995 INFO L290 TraceCheckUtils]: 138: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {51710#(= |old(~last_index~0)| ~last_index~0)} is VALID [2022-02-20 21:54:11,996 INFO L272 TraceCheckUtils]: 139: Hoare triple {51710#(= |old(~last_index~0)| ~last_index~0)} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,996 INFO L290 TraceCheckUtils]: 140: Hoare triple {51789#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~1;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~1 := 0; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,997 INFO L290 TraceCheckUtils]: 141: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,997 INFO L290 TraceCheckUtils]: 142: Hoare triple {51802#(and (<= 0 ldv_set_remove_~i~1) (= |old(~last_index~0)| ~last_index~0))} assume ~i~1 < ~last_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,998 INFO L290 TraceCheckUtils]: 143: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} call #t~mem188.base, #t~mem188.offset := read~$Pointer$(~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~i~1, 8); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,999 INFO L290 TraceCheckUtils]: 144: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume (#t~mem188.base + #t~mem188.offset) % 18446744073709551616 == (~e.base + ~e.offset) % 18446744073709551616;havoc #t~mem188.base, #t~mem188.offset;~deleted_index~0 := ~i~1; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:11,999 INFO L290 TraceCheckUtils]: 145: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume -1 != ~deleted_index~0;~i~1 := 1 + ~deleted_index~0; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:12,000 INFO L290 TraceCheckUtils]: 146: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !false; {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:12,000 INFO L290 TraceCheckUtils]: 147: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} assume !(~i~1 < ~last_index~0); {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:54:12,001 INFO L290 TraceCheckUtils]: 148: Hoare triple {51803#(and (<= 1 ~last_index~0) (= |old(~last_index~0)| ~last_index~0))} ~last_index~0 := ~last_index~0 - 1; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:12,001 INFO L290 TraceCheckUtils]: 149: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:12,002 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #854#return; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:12,002 INFO L290 TraceCheckUtils]: 151: Hoare triple {51801#(<= 1 |old(~last_index~0)|)} assume true; {51801#(<= 1 |old(~last_index~0)|)} is VALID [2022-02-20 21:54:12,003 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {51801#(<= 1 |old(~last_index~0)|)} {51710#(= |old(~last_index~0)| ~last_index~0)} #874#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,004 INFO L290 TraceCheckUtils]: 153: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} havoc eem_linkcmd_#t~nondet93#1;call eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset := read~$Pointer$(eem_linkcmd_~dev#1.base, 440 + eem_linkcmd_~dev#1.offset, 8);havoc eem_linkcmd_#t~mem94#1.base, eem_linkcmd_#t~mem94#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,004 INFO L290 TraceCheckUtils]: 154: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume { :end_inline_eem_linkcmd } true; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,005 INFO L272 TraceCheckUtils]: 155: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} call #t~ret154#1.base, #t~ret154#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, ~len~1#1 % 65536); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:12,005 INFO L290 TraceCheckUtils]: 156: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {51574#true} is VALID [2022-02-20 21:54:12,005 INFO L272 TraceCheckUtils]: 157: Hoare triple {51574#true} call #t~ret204.base, #t~ret204.offset := ldv_malloc(1); {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:12,006 INFO L290 TraceCheckUtils]: 158: Hoare triple {51776#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~5.base, ~tmp~5.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~tmp___0~1 := #t~nondet47;havoc #t~nondet47; {51574#true} is VALID [2022-02-20 21:54:12,006 INFO L290 TraceCheckUtils]: 159: Hoare triple {51574#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {51574#true} is VALID [2022-02-20 21:54:12,006 INFO L290 TraceCheckUtils]: 160: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:12,006 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {51574#true} {51574#true} #848#return; {51574#true} is VALID [2022-02-20 21:54:12,006 INFO L290 TraceCheckUtils]: 162: Hoare triple {51574#true} #res.base, #res.offset := #t~ret204.base, #t~ret204.offset;havoc #t~ret204.base, #t~ret204.offset; {51574#true} is VALID [2022-02-20 21:54:12,006 INFO L290 TraceCheckUtils]: 163: Hoare triple {51574#true} assume true; {51574#true} is VALID [2022-02-20 21:54:12,007 INFO L284 TraceCheckUtils]: 164: Hoare quadruple {51574#true} {51766#(not (= |old(~last_index~0)| 0))} #888#return; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,008 INFO L290 TraceCheckUtils]: 165: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} havoc #t~ret154#1.base, #t~ret154#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,008 INFO L290 TraceCheckUtils]: 166: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} call #t~mem155#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,008 INFO L290 TraceCheckUtils]: 167: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume !(0 != #t~mem155#1 % 4294967296);havoc #t~mem155#1;#res#1 := 1;call ULTIMATE.dealloc(~#descriptor~0#1.base, ~#descriptor~0#1.offset);havoc ~#descriptor~0#1.base, ~#descriptor~0#1.offset; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,009 INFO L290 TraceCheckUtils]: 168: Hoare triple {51766#(not (= |old(~last_index~0)| 0))} assume true; {51766#(not (= |old(~last_index~0)| 0))} is VALID [2022-02-20 21:54:12,010 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {51766#(not (= |old(~last_index~0)| 0))} {51584#(= ~last_index~0 0)} #916#return; {51575#false} is VALID [2022-02-20 21:54:12,010 INFO L290 TraceCheckUtils]: 170: Hoare triple {51575#false} assume -2147483648 <= main_#t~ret178#1 && main_#t~ret178#1 <= 2147483647;havoc main_#t~ret178#1;~ldv_state_variable_2~0 := 1; {51575#false} is VALID [2022-02-20 21:54:12,010 INFO L290 TraceCheckUtils]: 171: Hoare triple {51575#false} assume !(2 == ~ldv_state_variable_2~0); {51575#false} is VALID [2022-02-20 21:54:12,010 INFO L290 TraceCheckUtils]: 172: Hoare triple {51575#false} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___1~3#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___1~3#1; {51575#false} is VALID [2022-02-20 21:54:12,010 INFO L290 TraceCheckUtils]: 173: Hoare triple {51575#false} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___1~3#1; {51575#false} is VALID [2022-02-20 21:54:12,010 INFO L290 TraceCheckUtils]: 174: Hoare triple {51575#false} assume main_#t~switch165#1; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 175: Hoare triple {51575#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet173#1 && main_#t~nondet173#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet173#1;havoc main_#t~nondet173#1;main_#t~switch174#1 := 0 == main_~tmp___3~2#1; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 176: Hoare triple {51575#false} assume main_#t~switch174#1; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 177: Hoare triple {51575#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_eem_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_13 } true;ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset := ~#eem_driver~0.base, ~#eem_driver~0.offset;havoc ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset := ldv_usb_deregister_13_#in~arg#1.base, ldv_usb_deregister_13_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_13_~arg#1.base, ldv_usb_deregister_13_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 178: Hoare triple {51575#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 179: Hoare triple {51575#false} assume { :end_inline_ldv_usb_deregister_13 } true; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 180: Hoare triple {51575#false} assume { :end_inline_eem_driver_exit } true;~ldv_state_variable_0~0 := 2; {51575#false} is VALID [2022-02-20 21:54:12,011 INFO L290 TraceCheckUtils]: 181: Hoare triple {51575#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret196#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {51575#false} is VALID [2022-02-20 21:54:12,012 INFO L290 TraceCheckUtils]: 182: Hoare triple {51575#false} ldv_check_final_state_#t~ret196#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret196#1 && ldv_check_final_state_#t~ret196#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret196#1;havoc ldv_check_final_state_#t~ret196#1; {51575#false} is VALID [2022-02-20 21:54:12,012 INFO L290 TraceCheckUtils]: 183: Hoare triple {51575#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {51575#false} is VALID [2022-02-20 21:54:12,012 INFO L272 TraceCheckUtils]: 184: Hoare triple {51575#false} call ldv_error(); {51575#false} is VALID [2022-02-20 21:54:12,012 INFO L290 TraceCheckUtils]: 185: Hoare triple {51575#false} assume !false; {51575#false} is VALID [2022-02-20 21:54:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-02-20 21:54:12,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:12,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684410046] [2022-02-20 21:54:12,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684410046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:12,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:12,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 21:54:12,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246739000] [2022-02-20 21:54:12,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:12,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 186 [2022-02-20 21:54:12,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:12,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) [2022-02-20 21:54:12,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:12,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 21:54:12,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:12,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 21:54:12,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:54:12,151 INFO L87 Difference]: Start difference. First operand 2564 states and 3468 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 8 states have internal predecessors, (109), 5 states have call successors, (22), 7 states have call predecessors, (22), 3 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21)