./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.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 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:49:05,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:49:05,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:49:05,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:49:05,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:49:05,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:49:05,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:49:05,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:49:05,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:49:05,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:49:05,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:49:05,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:49:05,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:49:05,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:49:05,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:49:05,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:49:05,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:49:05,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:49:05,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:49:05,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:49:05,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:49:05,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:49:05,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:49:05,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:49:05,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:49:05,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:49:05,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:49:05,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:49:05,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:49:05,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:49:05,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:49:05,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:49:05,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:49:05,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:49:05,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:49:05,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:49:05,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:49:05,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:49:05,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:49:05,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:49:05,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:49:05,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:49:05,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:49:05,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:49:05,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:49:05,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:49:05,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:49:05,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:49:05,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:49:05,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:49:05,984 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:49:05,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:49:05,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:49:05,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:49:05,987 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:49:05,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:49:05,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:49:05,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:49:05,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:49:05,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:49:05,989 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:49:05,989 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 -> 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 [2022-02-20 22:49:06,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:49:06,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:49:06,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:49:06,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:49:06,214 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:49:06,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-02-20 22:49:06,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3206bf3e/2ef21d1f9b4c4222ad06740ba302c542/FLAGcc5ef5f52 [2022-02-20 22:49:06,920 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:49:06,920 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-02-20 22:49:06,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3206bf3e/2ef21d1f9b4c4222ad06740ba302c542/FLAGcc5ef5f52 [2022-02-20 22:49:07,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3206bf3e/2ef21d1f9b4c4222ad06740ba302c542 [2022-02-20 22:49:07,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:49:07,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:49:07,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:49:07,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:49:07,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:49:07,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:49:07" (1/1) ... [2022-02-20 22:49:07,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e427870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:07, skipping insertion in model container [2022-02-20 22:49:07,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:49:07" (1/1) ... [2022-02-20 22:49:07,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:49:07,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:49:09,006 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[320934,320947] [2022-02-20 22:49:09,008 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321103,321116] [2022-02-20 22:49:09,008 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321270,321283] [2022-02-20 22:49:09,009 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321438,321451] [2022-02-20 22:49:09,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:49:09,064 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:49:09,314 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[320934,320947] [2022-02-20 22:49:09,315 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321103,321116] [2022-02-20 22:49:09,315 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321270,321283] [2022-02-20 22:49:09,315 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i[321438,321451] [2022-02-20 22:49:09,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:49:09,418 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:49:09,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09 WrapperNode [2022-02-20 22:49:09,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:49:09,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:49:09,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:49:09,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:49:09,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,723 INFO L137 Inliner]: procedures = 418, calls = 1969, calls flagged for inlining = 195, calls inlined = 179, statements flattened = 5299 [2022-02-20 22:49:09,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:49:09,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:49:09,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:49:09,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:49:09,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:49:09,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:49:09,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:49:09,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:49:09,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (1/1) ... [2022-02-20 22:49:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:49:09,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:49:09,985 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 22:49:10,002 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 22:49:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-02-20 22:49:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-02-20 22:49:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-02-20 22:49:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-02-20 22:49:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:49:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:49:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-02-20 22:49:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-02-20 22:49:10,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:49:10,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:49:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure fst_remove_one [2022-02-20 22:49:10,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_remove_one [2022-02-20 22:49:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-02-20 22:49:10,015 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-02-20 22:49:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-02-20 22:49:10,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-02-20 22:49:10,015 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-02-20 22:49:10,015 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-02-20 22:49:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-02-20 22:49:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-02-20 22:49:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-02-20 22:49:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-02-20 22:49:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-02-20 22:49:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-02-20 22:49:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_67 [2022-02-20 22:49:10,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_67 [2022-02-20 22:49:10,016 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:49:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:49:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure fst_close [2022-02-20 22:49:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_close [2022-02-20 22:49:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-02-20 22:49:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-02-20 22:49:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-02-20 22:49:10,017 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-02-20 22:49:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:49:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:49:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure fst_tx_timeout [2022-02-20 22:49:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_tx_timeout [2022-02-20 22:49:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:49:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:49:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:49:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-02-20 22:49:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-02-20 22:49:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure fst_open [2022-02-20 22:49:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_open [2022-02-20 22:49:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_type_trans [2022-02-20 22:49:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_type_trans [2022-02-20 22:49:10,019 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 22:49:10,019 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 22:49:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:49:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 22:49:10,020 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 22:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-02-20 22:49:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-02-20 22:49:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:49:10,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:49:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:49:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-02-20 22:49:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-02-20 22:49:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:49:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-02-20 22:49:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-02-20 22:49:10,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:49:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:49:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure fst_issue_cmd [2022-02-20 22:49:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_issue_cmd [2022-02-20 22:49:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-02-20 22:49:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-02-20 22:49:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-02-20 22:49:10,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-02-20 22:49:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-02-20 22:49:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-02-20 22:49:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-02-20 22:49:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-02-20 22:49:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-02-20 22:49:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-02-20 22:49:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-02-20 22:49:10,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-02-20 22:49:10,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:49:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-02-20 22:49:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-02-20 22:49:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-02-20 22:49:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-02-20 22:49:10,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-02-20 22:49:10,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-02-20 22:49:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:49:10,026 INFO L130 BoogieDeclarations]: Found specification of procedure fst_cpureset [2022-02-20 22:49:10,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_cpureset [2022-02-20 22:49:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:49:10,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:49:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:49:10,027 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:49:10,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:49:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-02-20 22:49:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-02-20 22:49:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-02-20 22:49:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-02-20 22:49:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-02-20 22:49:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-02-20 22:49:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure fst_q_work_item [2022-02-20 22:49:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_q_work_item [2022-02-20 22:49:10,028 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-02-20 22:49:10,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-02-20 22:49:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:49:10,029 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:49:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 22:49:10,029 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 22:49:10,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-02-20 22:49:10,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-02-20 22:49:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-02-20 22:49:10,030 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-02-20 22:49:10,030 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-02-20 22:49:10,030 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-02-20 22:49:10,031 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-02-20 22:49:10,032 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-02-20 22:49:10,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:49:10,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:49:10,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:49:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:49:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:49:10,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:49:10,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-02-20 22:49:10,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-02-20 22:49:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-02-20 22:49:10,039 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-02-20 22:49:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:49:10,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:49:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 22:49:10,039 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 22:49:10,039 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-02-20 22:49:10,039 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-02-20 22:49:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure module_put [2022-02-20 22:49:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure module_put [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-02-20 22:49:10,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-02-20 22:49:10,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:49:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 22:49:10,041 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 22:49:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-02-20 22:49:10,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-02-20 22:49:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-02-20 22:49:10,041 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-02-20 22:49:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-02-20 22:49:10,041 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-02-20 22:49:10,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-02-20 22:49:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-02-20 22:49:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-02-20 22:49:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-02-20 22:49:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-02-20 22:49:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-02-20 22:49:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure farsync_type_trans [2022-02-20 22:49:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure farsync_type_trans [2022-02-20 22:49:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:49:10,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:49:10,042 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-02-20 22:49:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-02-20 22:49:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_fst_work_q_lock [2022-02-20 22:49:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_fst_work_q_lock [2022-02-20 22:49:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:49:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:49:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:49:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure fst_disable_intr [2022-02-20 22:49:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_disable_intr [2022-02-20 22:49:10,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:49:10,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:49:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-02-20 22:49:10,044 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-02-20 22:49:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-02-20 22:49:10,044 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-02-20 22:49:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure do_bottom_half_tx [2022-02-20 22:49:10,044 INFO L138 BoogieDeclarations]: Found implementation of procedure do_bottom_half_tx [2022-02-20 22:49:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure fst_process_rx_status [2022-02-20 22:49:10,044 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_process_rx_status [2022-02-20 22:49:10,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-02-20 22:49:10,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-02-20 22:49:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-02-20 22:49:10,045 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-02-20 22:49:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_ioctl [2022-02-20 22:49:10,045 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_ioctl [2022-02-20 22:49:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-02-20 22:49:10,045 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-02-20 22:49:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-02-20 22:49:10,045 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-02-20 22:49:10,045 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-02-20 22:49:10,045 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-02-20 22:49:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure fst_clear_intr [2022-02-20 22:49:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_clear_intr [2022-02-20 22:49:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:49:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-02-20 22:49:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-02-20 22:49:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-02-20 22:49:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-02-20 22:49:10,046 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-02-20 22:49:10,046 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-02-20 22:49:10,785 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:49:10,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:49:10,873 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:49:14,435 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-02-20 22:49:14,603 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:49:14,622 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:49:14,622 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:49:14,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:49:14 BoogieIcfgContainer [2022-02-20 22:49:14,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:49:14,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:49:14,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:49:14,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:49:14,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:49:07" (1/3) ... [2022-02-20 22:49:14,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b93f279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:49:14, skipping insertion in model container [2022-02-20 22:49:14,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:49:09" (2/3) ... [2022-02-20 22:49:14,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b93f279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:49:14, skipping insertion in model container [2022-02-20 22:49:14,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:49:14" (3/3) ... [2022-02-20 22:49:14,630 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-02-20 22:49:14,634 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:49:14,634 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 22:49:14,667 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:49:14,671 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 22:49:14,672 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 22:49:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) [2022-02-20 22:49:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 22:49:14,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:49:14,745 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:14,745 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 22:49:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:49:14,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1565129519, now seen corresponding path program 1 times [2022-02-20 22:49:14,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:49:14,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850137286] [2022-02-20 22:49:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:49:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:49:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:49:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,173 INFO L272 TraceCheckUtils]: 1: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,174 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,175 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #4164#return; {1865#true} is VALID [2022-02-20 22:49:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:49:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,192 INFO L272 TraceCheckUtils]: 1: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,193 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,194 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #4166#return; {1865#true} is VALID [2022-02-20 22:49:15,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 22:49:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,210 INFO L272 TraceCheckUtils]: 1: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,224 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,224 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #4168#return; {1865#true} is VALID [2022-02-20 22:49:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 22:49:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,243 INFO L272 TraceCheckUtils]: 1: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,243 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,244 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #4170#return; {1865#true} is VALID [2022-02-20 22:49:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:49:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,269 INFO L272 TraceCheckUtils]: 1: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,269 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,270 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #4172#return; {1865#true} is VALID [2022-02-20 22:49:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 22:49:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1865#true} {1912#(= 9 ~ldv_statevar_12~0)} #4174#return; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:49:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:15,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} ~expression := #in~expression; {1865#true} is VALID [2022-02-20 22:49:15,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume !(0 == ~expression); {1865#true} is VALID [2022-02-20 22:49:15,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1865#true} {1866#false} #4200#return; {1866#false} is VALID [2022-02-20 22:49:15,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {1865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(199, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(63, 3);call #Ultimate.allocInit(34, 4);call #Ultimate.allocInit(57, 5);call #Ultimate.allocInit(70, 6);call #Ultimate.allocInit(48, 7);call #Ultimate.allocInit(52, 8);call #Ultimate.allocInit(43, 9);call #Ultimate.allocInit(55, 10);call #Ultimate.allocInit(40, 11);call #Ultimate.allocInit(73, 12);call #Ultimate.allocInit(66, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(12, 20);call #Ultimate.allocInit(62, 21);call #Ultimate.allocInit(37, 22);call #Ultimate.allocInit(77, 23);call #Ultimate.allocInit(46, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(8, 26);call #Ultimate.allocInit(46, 27);call #Ultimate.allocInit(40, 28);call #Ultimate.allocInit(39, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(43, 31);call #Ultimate.allocInit(27, 32);call #Ultimate.allocInit(34, 33);call #Ultimate.allocInit(44, 34);call #Ultimate.allocInit(44, 35);call #Ultimate.allocInit(4, 36);call write~init~int(102, 36, 0, 1);call write~init~int(115, 36, 1, 1);call write~init~int(116, 36, 2, 1);call write~init~int(0, 36, 3, 1);call #Ultimate.allocInit(27, 37);call #Ultimate.allocInit(8, 38);call #Ultimate.allocInit(40, 39);call #Ultimate.allocInit(1, 40);call write~init~int(0, 40, 0, 1);call #Ultimate.allocInit(2, 41);call write~init~int(48, 41, 0, 1);call write~init~int(0, 41, 1, 1);call #Ultimate.allocInit(83, 42);~fst_txq_low~0 := 8;~fst_txq_high~0 := 12;~fst_max_reads~0 := 7;~fst_excluded_cards~0 := 0;~#fst_excluded_list~0.base, ~#fst_excluded_list~0.offset := 43, 0;call #Ultimate.allocInit(128, 43);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fst_excluded_list~0.base);~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset := 44, 0;call #Ultimate.allocInit(256, 44);call write~init~int(5657, ~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1024, ~#fst_pci_dev_id~0.base, 4 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 8 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 12 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 16 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 20 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1, ~#fst_pci_dev_id~0.base, 24 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 32 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1088, ~#fst_pci_dev_id~0.base, 36 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 40 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 44 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 48 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 52 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(2, ~#fst_pci_dev_id~0.base, 56 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 64 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1552, ~#fst_pci_dev_id~0.base, 68 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 72 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 76 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 80 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 84 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(3, ~#fst_pci_dev_id~0.base, 88 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 96 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1568, ~#fst_pci_dev_id~0.base, 100 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 104 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 108 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 112 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 116 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4, ~#fst_pci_dev_id~0.base, 120 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 128 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1600, ~#fst_pci_dev_id~0.base, 132 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 136 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 140 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 144 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 148 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5, ~#fst_pci_dev_id~0.base, 152 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 160 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5648, ~#fst_pci_dev_id~0.base, 164 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 168 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 172 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 176 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 180 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(6, ~#fst_pci_dev_id~0.base, 184 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 192 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5650, ~#fst_pci_dev_id~0.base, 196 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 200 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 204 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 208 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 212 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(6, ~#fst_pci_dev_id~0.base, 216 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(0, ~#fst_pci_dev_id~0.base, 224 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 228 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 232 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 236 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 240 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 244 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 248 + ~#fst_pci_dev_id~0.offset, 8);~__mod_pci_device_table~0.vendor := 0;~__mod_pci_device_table~0.device := 0;~__mod_pci_device_table~0.subvendor := 0;~__mod_pci_device_table~0.subdevice := 0;~__mod_pci_device_table~0.class := 0;~__mod_pci_device_table~0.class_mask := 0;~__mod_pci_device_table~0.driver_data := 0;~#fst_tx_task~0.base, ~#fst_tx_task~0.offset := 45, 0;call #Ultimate.allocInit(36, 45);call write~init~$Pointer$(0, 0, ~#fst_tx_task~0.base, ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 8 + ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 16 + ~#fst_tx_task~0.offset, 4);call write~init~$Pointer$(#funAddr~fst_process_tx_work_q.base, #funAddr~fst_process_tx_work_q.offset, ~#fst_tx_task~0.base, 20 + ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 28 + ~#fst_tx_task~0.offset, 8);~#fst_int_task~0.base, ~#fst_int_task~0.offset := 46, 0;call #Ultimate.allocInit(36, 46);call write~init~$Pointer$(0, 0, ~#fst_int_task~0.base, ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 8 + ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 16 + ~#fst_int_task~0.offset, 4);call write~init~$Pointer$(#funAddr~fst_process_int_work_q.base, #funAddr~fst_process_int_work_q.offset, ~#fst_int_task~0.base, 20 + ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 28 + ~#fst_int_task~0.offset, 8);~#fst_card_array~0.base, ~#fst_card_array~0.offset := 47, 0;call #Ultimate.allocInit(256, 47);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fst_card_array~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fst_card_array~0.base);~#fst_work_q_lock~0.base, ~#fst_work_q_lock~0.offset := 48, 0;call #Ultimate.allocInit(68, 48);call write~init~int(0, ~#fst_work_q_lock~0.base, ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 4 + ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 8 + ~#fst_work_q_lock~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 12 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 20 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 28 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 36 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 44 + ~#fst_work_q_lock~0.offset, 8);call write~init~int(0, ~#fst_work_q_lock~0.base, 52 + ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 56 + ~#fst_work_q_lock~0.offset, 8);~#fst_work_txq~0.base, ~#fst_work_txq~0.offset := 49, 0;call #Ultimate.allocInit(8, 49);call write~init~int(0, ~#fst_work_txq~0.base, ~#fst_work_txq~0.offset, 8);~#fst_work_intq~0.base, ~#fst_work_intq~0.offset := 50, 0;call #Ultimate.allocInit(8, 50);call write~init~int(0, ~#fst_work_intq~0.base, ~#fst_work_intq~0.offset, 8);~#type_strings~0.base, ~#type_strings~0.offset := 51, 0;call #Ultimate.allocInit(56, 51);call write~init~$Pointer$(14, 0, ~#type_strings~0.base, ~#type_strings~0.offset, 8);call write~init~$Pointer$(15, 0, ~#type_strings~0.base, 8 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(16, 0, ~#type_strings~0.base, 16 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(17, 0, ~#type_strings~0.base, 24 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(18, 0, ~#type_strings~0.base, 32 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(19, 0, ~#type_strings~0.base, 40 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(20, 0, ~#type_strings~0.base, 48 + ~#type_strings~0.offset, 8);~#fst_ops~0.base, ~#fst_ops~0.offset := 52, 0;call #Ultimate.allocInit(472, 52);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 8 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_open.base, #funAddr~fst_open.offset, ~#fst_ops~0.base, 16 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_close.base, #funAddr~fst_close.offset, ~#fst_ops~0.base, 24 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_start_xmit.base, #funAddr~hdlc_start_xmit.offset, ~#fst_ops~0.base, 32 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 40 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 48 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 56 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 64 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 72 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_ioctl.base, #funAddr~fst_ioctl.offset, ~#fst_ops~0.base, 80 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 88 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset, ~#fst_ops~0.base, 96 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 104 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_tx_timeout.base, #funAddr~fst_tx_timeout.offset, ~#fst_ops~0.base, 112 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 120 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 128 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 136 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 144 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 152 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 160 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 168 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 176 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 184 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 192 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 200 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 208 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 216 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 224 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 232 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 240 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 248 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 256 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 264 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 272 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 280 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 288 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 296 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 304 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 312 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 320 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 328 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 336 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 344 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 352 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 360 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 368 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 376 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 384 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 392 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 400 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 408 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 416 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 424 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 432 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 440 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 448 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 456 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 464 + ~#fst_ops~0.offset, 8);~#fst_driver~0.base, ~#fst_driver~0.offset := 53, 0;call #Ultimate.allocInit(301, 53);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 8 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(36, 0, ~#fst_driver~0.base, 16 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset, ~#fst_driver~0.base, 24 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_add_one.base, #funAddr~fst_add_one.offset, ~#fst_driver~0.base, 32 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_remove_one.base, #funAddr~fst_remove_one.offset, ~#fst_driver~0.base, 40 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 48 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 56 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 64 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 72 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 80 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 88 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 96 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 104 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 112 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 120 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 128 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 136 + ~#fst_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 137 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 145 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 153 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 161 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 169 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 177 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 185 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 193 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 201 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 209 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 217 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 221 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 225 + ~#fst_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 229 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 237 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 245 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 253 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 261 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 269 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 273 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 285 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 293 + ~#fst_driver~0.offset, 8);~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := 0, 0;~ldv_0_line_line~0 := 0;~ldv_0_ret_val_default~0 := 0;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0;~ldv_12_ret_default~0 := 0;~ldv_1_container_net_device~0.base, ~ldv_1_container_net_device~0.offset := 0, 0;~ldv_1_container_struct_ifreq_ptr~0.base, ~ldv_1_container_struct_ifreq_ptr~0.offset := 0, 0;~ldv_1_container_struct_sk_buff_ptr~0.base, ~ldv_1_container_struct_sk_buff_ptr~0.offset := 0, 0;~ldv_1_ldv_param_3_1_default~0 := 0;~ldv_1_ldv_param_9_2_default~0 := 0;~ldv_2_container_pci_driver~0.base, ~ldv_2_container_pci_driver~0.offset := 0, 0;~ldv_2_resource_dev~0.base, ~ldv_2_resource_dev~0.offset := 0, 0;~#ldv_2_resource_pm_message~0.base, ~#ldv_2_resource_pm_message~0.offset := 54, 0;call #Ultimate.allocInit(4, 54);call write~init~int(0, ~#ldv_2_resource_pm_message~0.base, ~#ldv_2_resource_pm_message~0.offset, 4);~ldv_2_resource_struct_pci_device_id_ptr~0.base, ~ldv_2_resource_struct_pci_device_id_ptr~0.offset := 0, 0;~ldv_2_ret_default~0 := 0;~ldv_3_ldv_param_9_0_default~0 := 0;~ldv_3_ret_default~0 := 0;~ldv_4_ldv_param_9_0_default~0 := 0;~ldv_4_ret_default~0 := 0;~ldv_statevar_0~0 := 0;~ldv_statevar_1~0 := 0;~ldv_statevar_12~0 := 0;~ldv_statevar_2~0 := 0;~ldv_statevar_3~0 := 0;~ldv_statevar_4~0 := 0;~ldv_0_callback_handler~0.base, ~ldv_0_callback_handler~0.offset := #funAddr~fst_intr.base, #funAddr~fst_intr.offset;~ldv_12_exit_fst_cleanup_module_default~0.base, ~ldv_12_exit_fst_cleanup_module_default~0.offset := #funAddr~fst_cleanup_module.base, #funAddr~fst_cleanup_module.offset;~ldv_12_init_fst_init_default~0.base, ~ldv_12_init_fst_init_default~0.offset := #funAddr~fst_init.base, #funAddr~fst_init.offset;~ldv_1_callback_ndo_change_mtu~0.base, ~ldv_1_callback_ndo_change_mtu~0.offset := #funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset;~ldv_1_callback_ndo_do_ioctl~0.base, ~ldv_1_callback_ndo_do_ioctl~0.offset := #funAddr~fst_ioctl.base, #funAddr~fst_ioctl.offset;~ldv_1_callback_ndo_start_xmit~0.base, ~ldv_1_callback_ndo_start_xmit~0.offset := #funAddr~hdlc_start_xmit.base, #funAddr~hdlc_start_xmit.offset;~ldv_1_callback_ndo_stop~0.base, ~ldv_1_callback_ndo_stop~0.offset := #funAddr~fst_close.base, #funAddr~fst_close.offset;~ldv_1_callback_ndo_tx_timeout~0.base, ~ldv_1_callback_ndo_tx_timeout~0.offset := #funAddr~fst_tx_timeout.base, #funAddr~fst_tx_timeout.offset;~ldv_3_callback_func~0.base, ~ldv_3_callback_func~0.offset := #funAddr~fst_process_int_work_q.base, #funAddr~fst_process_int_work_q.offset;~ldv_4_callback_func~0.base, ~ldv_4_callback_func~0.offset := #funAddr~fst_process_tx_work_q.base, #funAddr~fst_process_tx_work_q.offset;~ldv_spin__xmit_lock_of_netdev_queue~0 := 1;~ldv_spin_addr_list_lock_of_net_device~0 := 1;~ldv_spin_alloc_lock_of_task_struct~0 := 1;~ldv_spin_card_lock_of_fst_card_info~0 := 1;~ldv_spin_fst_work_q_lock~0 := 1;~ldv_spin_i_lock_of_inode~0 := 1;~ldv_spin_lock~0 := 1;~ldv_spin_lock_of_NOT_ARG_SIGN~0 := 1;~ldv_spin_lru_lock_of_netns_frags~0 := 1;~ldv_spin_node_size_lock_of_pglist_data~0 := 1;~ldv_spin_ptl~0 := 1;~ldv_spin_siglock_of_sighand_struct~0 := 1;~ldv_spin_tx_global_lock_of_net_device~0 := 1; {1865#true} is VALID [2022-02-20 22:49:15,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {1865#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret855#1, main_~tmp~49#1;havoc main_~tmp~49#1;assume { :begin_inline_ldv_initialize } true; {1865#true} is VALID [2022-02-20 22:49:15,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {1865#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_initialize_external_data } true;assume { :begin_inline_ldv_allocate_external_0 } true;havoc ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset, ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset, ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset, ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset, ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset; {1865#true} is VALID [2022-02-20 22:49:15,296 INFO L272 TraceCheckUtils]: 3: Hoare triple {1865#true} call ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset := ldv_malloc(0); {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:15,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,296 INFO L272 TraceCheckUtils]: 5: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,297 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,298 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1865#true} {1865#true} #4164#return; {1865#true} is VALID [2022-02-20 22:49:15,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {1865#true} ~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset;havoc ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,299 INFO L272 TraceCheckUtils]: 14: Hoare triple {1865#true} call ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset := ldv_malloc(3027); {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:15,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,299 INFO L272 TraceCheckUtils]: 16: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,299 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,300 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1865#true} {1865#true} #4166#return; {1865#true} is VALID [2022-02-20 22:49:15,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {1865#true} ~ldv_1_container_net_device~0.base, ~ldv_1_container_net_device~0.offset := ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset;havoc ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset; {1865#true} is VALID [2022-02-20 22:49:15,301 INFO L272 TraceCheckUtils]: 25: Hoare triple {1865#true} call ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset := ldv_malloc(37); {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:15,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,301 INFO L272 TraceCheckUtils]: 27: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,302 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,303 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1865#true} {1865#true} #4168#return; {1865#true} is VALID [2022-02-20 22:49:15,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {1865#true} ~ldv_1_container_struct_ifreq_ptr~0.base, ~ldv_1_container_struct_ifreq_ptr~0.offset := ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset;havoc ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset; {1865#true} is VALID [2022-02-20 22:49:15,305 INFO L272 TraceCheckUtils]: 36: Hoare triple {1865#true} call ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset := ldv_malloc(245); {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:15,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,305 INFO L272 TraceCheckUtils]: 38: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,306 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1865#true} {1865#true} #4170#return; {1865#true} is VALID [2022-02-20 22:49:15,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {1865#true} ~ldv_1_container_struct_sk_buff_ptr~0.base, ~ldv_1_container_struct_sk_buff_ptr~0.offset := ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset;havoc ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset; {1865#true} is VALID [2022-02-20 22:49:15,307 INFO L272 TraceCheckUtils]: 47: Hoare triple {1865#true} call ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset := ldv_malloc(3018); {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:15,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {1920#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {1865#true} is VALID [2022-02-20 22:49:15,308 INFO L272 TraceCheckUtils]: 49: Hoare triple {1865#true} call #t~ret969 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,308 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1865#true} {1865#true} #3850#return; {1865#true} is VALID [2022-02-20 22:49:15,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {1865#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {1865#true} is VALID [2022-02-20 22:49:15,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {1865#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {1865#true} is VALID [2022-02-20 22:49:15,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,309 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1865#true} {1865#true} #4172#return; {1865#true} is VALID [2022-02-20 22:49:15,309 INFO L290 TraceCheckUtils]: 57: Hoare triple {1865#true} ~ldv_2_resource_dev~0.base, ~ldv_2_resource_dev~0.offset := ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset;havoc ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset; {1865#true} is VALID [2022-02-20 22:49:15,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {1865#true} assume { :end_inline_ldv_allocate_external_0 } true; {1865#true} is VALID [2022-02-20 22:49:15,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {1865#true} assume { :end_inline_ldv_initialize_external_data } true;~ldv_statevar_12~0 := 9;~ldv_statevar_0~0 := 6;~ldv_statevar_1~0 := 5;~ldv_2_ret_default~0 := 1;~ldv_statevar_2~0 := 20;~ldv_3_ret_default~0 := 1;~ldv_statevar_3~0 := 19;~ldv_4_ret_default~0 := 1;~ldv_statevar_4~0 := 19; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,310 INFO L272 TraceCheckUtils]: 60: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} call main_#t~ret855#1 := ldv_undef_int(); {1865#true} is VALID [2022-02-20 22:49:15,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {1865#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {1865#true} is VALID [2022-02-20 22:49:15,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,311 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {1865#true} {1912#(= 9 ~ldv_statevar_12~0)} #4174#return; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,312 INFO L290 TraceCheckUtils]: 64: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume -2147483648 <= main_#t~ret855#1 && main_#t~ret855#1 <= 2147483647;main_~tmp~49#1 := main_#t~ret855#1;havoc main_#t~ret855#1; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,312 INFO L290 TraceCheckUtils]: 65: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume 0 == main_~tmp~49#1; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume { :begin_inline_ldv_entry_EMGentry_12 } true;ldv_entry_EMGentry_12_#in~arg0#1.base, ldv_entry_EMGentry_12_#in~arg0#1.offset := 0, 0;havoc ldv_entry_EMGentry_12_#t~ret851#1, ldv_entry_EMGentry_12_#t~ret852#1, ldv_entry_EMGentry_12_#t~ret853#1, ldv_entry_EMGentry_12_#t~ret854#1, ldv_entry_EMGentry_12_~arg0#1.base, ldv_entry_EMGentry_12_~arg0#1.offset, ldv_entry_EMGentry_12_~tmp~48#1, ldv_entry_EMGentry_12_~tmp___0~19#1;ldv_entry_EMGentry_12_~arg0#1.base, ldv_entry_EMGentry_12_~arg0#1.offset := ldv_entry_EMGentry_12_#in~arg0#1.base, ldv_entry_EMGentry_12_#in~arg0#1.offset;havoc ldv_entry_EMGentry_12_~tmp~48#1;havoc ldv_entry_EMGentry_12_~tmp___0~19#1; {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume !(2 == ~ldv_statevar_12~0); {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume !(3 == ~ldv_statevar_12~0); {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume !(4 == ~ldv_statevar_12~0); {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume !(5 == ~ldv_statevar_12~0); {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume !(6 == ~ldv_statevar_12~0); {1912#(= 9 ~ldv_statevar_12~0)} is VALID [2022-02-20 22:49:15,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {1912#(= 9 ~ldv_statevar_12~0)} assume 8 == ~ldv_statevar_12~0; {1866#false} is VALID [2022-02-20 22:49:15,316 INFO L272 TraceCheckUtils]: 73: Hoare triple {1866#false} call ldv_assume((if 0 != ~ldv_12_ret_default~0 then 1 else 0)); {1865#true} is VALID [2022-02-20 22:49:15,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {1865#true} ~expression := #in~expression; {1865#true} is VALID [2022-02-20 22:49:15,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {1865#true} assume !(0 == ~expression); {1865#true} is VALID [2022-02-20 22:49:15,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {1865#true} assume true; {1865#true} is VALID [2022-02-20 22:49:15,316 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {1865#true} {1866#false} #4200#return; {1866#false} is VALID [2022-02-20 22:49:15,317 INFO L272 TraceCheckUtils]: 78: Hoare triple {1866#false} call ldv_check_final_state(); {1866#false} is VALID [2022-02-20 22:49:15,317 INFO L272 TraceCheckUtils]: 79: Hoare triple {1866#false} call ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit((if 1 == ~ldv_spin__xmit_lock_of_netdev_queue~0 then 1 else 0)); {1866#false} is VALID [2022-02-20 22:49:15,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {1866#false} ~expr := #in~expr; {1866#false} is VALID [2022-02-20 22:49:15,317 INFO L290 TraceCheckUtils]: 81: Hoare triple {1866#false} assume 0 == ~expr; {1866#false} is VALID [2022-02-20 22:49:15,317 INFO L290 TraceCheckUtils]: 82: Hoare triple {1866#false} assume !false; {1866#false} is VALID [2022-02-20 22:49:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-02-20 22:49:15,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:49:15,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850137286] [2022-02-20 22:49:15,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850137286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:49:15,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:49:15,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:49:15,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183514077] [2022-02-20 22:49:15,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:49:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-02-20 22:49:15,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:49:15,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:15,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:49:15,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:49:15,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:49:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:49:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:49:15,412 INFO L87 Difference]: Start difference. First operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:49:32,281 INFO L93 Difference]: Finished difference Result 5468 states and 7881 transitions. [2022-02-20 22:49:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:49:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-02-20 22:49:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:49:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7881 transitions. [2022-02-20 22:49:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7881 transitions. [2022-02-20 22:49:33,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7881 transitions. [2022-02-20 22:49:39,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7881 edges. 7881 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:49:40,079 INFO L225 Difference]: With dead ends: 5468 [2022-02-20 22:49:40,079 INFO L226 Difference]: Without dead ends: 3610 [2022-02-20 22:49:40,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:49:40,097 INFO L933 BasicCegarLoop]: 2785 mSDtfsCounter, 3022 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-20 22:49:40,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3464 Valid, 5269 Invalid, 3472 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1338 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-20 22:49:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2022-02-20 22:49:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3588. [2022-02-20 22:49:40,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:49:40,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3610 states. Second operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-02-20 22:49:40,325 INFO L74 IsIncluded]: Start isIncluded. First operand 3610 states. Second operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-02-20 22:49:40,350 INFO L87 Difference]: Start difference. First operand 3610 states. Second operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-02-20 22:49:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:49:40,794 INFO L93 Difference]: Finished difference Result 3610 states and 5084 transitions. [2022-02-20 22:49:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 5084 transitions. [2022-02-20 22:49:40,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:49:40,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:49:40,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) Second operand 3610 states. [2022-02-20 22:49:40,835 INFO L87 Difference]: Start difference. First operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) Second operand 3610 states. [2022-02-20 22:49:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:49:41,276 INFO L93 Difference]: Finished difference Result 3610 states and 5084 transitions. [2022-02-20 22:49:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 5084 transitions. [2022-02-20 22:49:41,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:49:41,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:49:41,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:49:41,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:49:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-02-20 22:49:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5049 transitions. [2022-02-20 22:49:42,032 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5049 transitions. Word has length 83 [2022-02-20 22:49:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:49:42,033 INFO L470 AbstractCegarLoop]: Abstraction has 3588 states and 5049 transitions. [2022-02-20 22:49:42,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5049 transitions. [2022-02-20 22:49:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 22:49:42,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:49:42,053 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:49:42,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:49:42,054 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 22:49:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:49:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1794242578, now seen corresponding path program 1 times [2022-02-20 22:49:42,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:49:42,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250410730] [2022-02-20 22:49:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:49:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:49:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:49:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,340 INFO L272 TraceCheckUtils]: 1: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,341 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,342 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #4164#return; {22391#true} is VALID [2022-02-20 22:49:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:49:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,356 INFO L272 TraceCheckUtils]: 1: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,357 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,358 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #4166#return; {22391#true} is VALID [2022-02-20 22:49:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 22:49:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,371 INFO L272 TraceCheckUtils]: 1: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,372 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,373 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #4168#return; {22391#true} is VALID [2022-02-20 22:49:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 22:49:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,389 INFO L272 TraceCheckUtils]: 1: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,390 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #4170#return; {22391#true} is VALID [2022-02-20 22:49:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:49:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:49:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L272 TraceCheckUtils]: 1: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,410 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,411 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #4172#return; {22391#true} is VALID [2022-02-20 22:49:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 22:49:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22391#true} {22438#(= 5 ~ldv_statevar_1~0)} #4174#return; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 22:49:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:49:42,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~tmp~21#1.base, ~tmp~21#1.offset;assume { :begin_inline_netdev_priv } true;netdev_priv_#in~dev#1.base, netdev_priv_#in~dev#1.offset := ~dev#1.base, ~dev#1.offset;havoc netdev_priv_#res#1.base, netdev_priv_#res#1.offset;havoc netdev_priv_~dev#1.base, netdev_priv_~dev#1.offset;netdev_priv_~dev#1.base, netdev_priv_~dev#1.offset := netdev_priv_#in~dev#1.base, netdev_priv_#in~dev#1.offset;netdev_priv_#res#1.base, netdev_priv_#res#1.offset := netdev_priv_~dev#1.base, 3200 + netdev_priv_~dev#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} #t~ret164#1.base, #t~ret164#1.offset := netdev_priv_#res#1.base, netdev_priv_#res#1.offset;assume { :end_inline_netdev_priv } true;~tmp~21#1.base, ~tmp~21#1.offset := #t~ret164#1.base, #t~ret164#1.offset;havoc #t~ret164#1.base, #t~ret164#1.offset;#res#1.base, #res#1.offset := ~tmp~21#1.base, ~tmp~21#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22391#true} {22392#false} #4048#return; {22392#false} is VALID [2022-02-20 22:49:42,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {22391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(199, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(63, 3);call #Ultimate.allocInit(34, 4);call #Ultimate.allocInit(57, 5);call #Ultimate.allocInit(70, 6);call #Ultimate.allocInit(48, 7);call #Ultimate.allocInit(52, 8);call #Ultimate.allocInit(43, 9);call #Ultimate.allocInit(55, 10);call #Ultimate.allocInit(40, 11);call #Ultimate.allocInit(73, 12);call #Ultimate.allocInit(66, 13);call #Ultimate.allocInit(12, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(12, 19);call #Ultimate.allocInit(12, 20);call #Ultimate.allocInit(62, 21);call #Ultimate.allocInit(37, 22);call #Ultimate.allocInit(77, 23);call #Ultimate.allocInit(46, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(8, 26);call #Ultimate.allocInit(46, 27);call #Ultimate.allocInit(40, 28);call #Ultimate.allocInit(39, 29);call #Ultimate.allocInit(8, 30);call #Ultimate.allocInit(43, 31);call #Ultimate.allocInit(27, 32);call #Ultimate.allocInit(34, 33);call #Ultimate.allocInit(44, 34);call #Ultimate.allocInit(44, 35);call #Ultimate.allocInit(4, 36);call write~init~int(102, 36, 0, 1);call write~init~int(115, 36, 1, 1);call write~init~int(116, 36, 2, 1);call write~init~int(0, 36, 3, 1);call #Ultimate.allocInit(27, 37);call #Ultimate.allocInit(8, 38);call #Ultimate.allocInit(40, 39);call #Ultimate.allocInit(1, 40);call write~init~int(0, 40, 0, 1);call #Ultimate.allocInit(2, 41);call write~init~int(48, 41, 0, 1);call write~init~int(0, 41, 1, 1);call #Ultimate.allocInit(83, 42);~fst_txq_low~0 := 8;~fst_txq_high~0 := 12;~fst_max_reads~0 := 7;~fst_excluded_cards~0 := 0;~#fst_excluded_list~0.base, ~#fst_excluded_list~0.offset := 43, 0;call #Ultimate.allocInit(128, 43);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#fst_excluded_list~0.base);~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset := 44, 0;call #Ultimate.allocInit(256, 44);call write~init~int(5657, ~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1024, ~#fst_pci_dev_id~0.base, 4 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 8 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 12 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 16 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 20 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1, ~#fst_pci_dev_id~0.base, 24 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 32 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1088, ~#fst_pci_dev_id~0.base, 36 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 40 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 44 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 48 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 52 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(2, ~#fst_pci_dev_id~0.base, 56 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 64 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1552, ~#fst_pci_dev_id~0.base, 68 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 72 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 76 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 80 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 84 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(3, ~#fst_pci_dev_id~0.base, 88 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 96 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1568, ~#fst_pci_dev_id~0.base, 100 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 104 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 108 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 112 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 116 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4, ~#fst_pci_dev_id~0.base, 120 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 128 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(1600, ~#fst_pci_dev_id~0.base, 132 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 136 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 140 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 144 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 148 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5, ~#fst_pci_dev_id~0.base, 152 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 160 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5648, ~#fst_pci_dev_id~0.base, 164 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 168 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 172 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 176 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 180 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(6, ~#fst_pci_dev_id~0.base, 184 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(5657, ~#fst_pci_dev_id~0.base, 192 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(5650, ~#fst_pci_dev_id~0.base, 196 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 200 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(4294967295, ~#fst_pci_dev_id~0.base, 204 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 208 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 212 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(6, ~#fst_pci_dev_id~0.base, 216 + ~#fst_pci_dev_id~0.offset, 8);call write~init~int(0, ~#fst_pci_dev_id~0.base, 224 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 228 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 232 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 236 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 240 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 244 + ~#fst_pci_dev_id~0.offset, 4);call write~init~int(0, ~#fst_pci_dev_id~0.base, 248 + ~#fst_pci_dev_id~0.offset, 8);~__mod_pci_device_table~0.vendor := 0;~__mod_pci_device_table~0.device := 0;~__mod_pci_device_table~0.subvendor := 0;~__mod_pci_device_table~0.subdevice := 0;~__mod_pci_device_table~0.class := 0;~__mod_pci_device_table~0.class_mask := 0;~__mod_pci_device_table~0.driver_data := 0;~#fst_tx_task~0.base, ~#fst_tx_task~0.offset := 45, 0;call #Ultimate.allocInit(36, 45);call write~init~$Pointer$(0, 0, ~#fst_tx_task~0.base, ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 8 + ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 16 + ~#fst_tx_task~0.offset, 4);call write~init~$Pointer$(#funAddr~fst_process_tx_work_q.base, #funAddr~fst_process_tx_work_q.offset, ~#fst_tx_task~0.base, 20 + ~#fst_tx_task~0.offset, 8);call write~init~int(0, ~#fst_tx_task~0.base, 28 + ~#fst_tx_task~0.offset, 8);~#fst_int_task~0.base, ~#fst_int_task~0.offset := 46, 0;call #Ultimate.allocInit(36, 46);call write~init~$Pointer$(0, 0, ~#fst_int_task~0.base, ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 8 + ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 16 + ~#fst_int_task~0.offset, 4);call write~init~$Pointer$(#funAddr~fst_process_int_work_q.base, #funAddr~fst_process_int_work_q.offset, ~#fst_int_task~0.base, 20 + ~#fst_int_task~0.offset, 8);call write~init~int(0, ~#fst_int_task~0.base, 28 + ~#fst_int_task~0.offset, 8);~#fst_card_array~0.base, ~#fst_card_array~0.offset := 47, 0;call #Ultimate.allocInit(256, 47);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fst_card_array~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#fst_card_array~0.base);~#fst_work_q_lock~0.base, ~#fst_work_q_lock~0.offset := 48, 0;call #Ultimate.allocInit(68, 48);call write~init~int(0, ~#fst_work_q_lock~0.base, ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 4 + ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 8 + ~#fst_work_q_lock~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 12 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 20 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 28 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 36 + ~#fst_work_q_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_work_q_lock~0.base, 44 + ~#fst_work_q_lock~0.offset, 8);call write~init~int(0, ~#fst_work_q_lock~0.base, 52 + ~#fst_work_q_lock~0.offset, 4);call write~init~int(0, ~#fst_work_q_lock~0.base, 56 + ~#fst_work_q_lock~0.offset, 8);~#fst_work_txq~0.base, ~#fst_work_txq~0.offset := 49, 0;call #Ultimate.allocInit(8, 49);call write~init~int(0, ~#fst_work_txq~0.base, ~#fst_work_txq~0.offset, 8);~#fst_work_intq~0.base, ~#fst_work_intq~0.offset := 50, 0;call #Ultimate.allocInit(8, 50);call write~init~int(0, ~#fst_work_intq~0.base, ~#fst_work_intq~0.offset, 8);~#type_strings~0.base, ~#type_strings~0.offset := 51, 0;call #Ultimate.allocInit(56, 51);call write~init~$Pointer$(14, 0, ~#type_strings~0.base, ~#type_strings~0.offset, 8);call write~init~$Pointer$(15, 0, ~#type_strings~0.base, 8 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(16, 0, ~#type_strings~0.base, 16 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(17, 0, ~#type_strings~0.base, 24 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(18, 0, ~#type_strings~0.base, 32 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(19, 0, ~#type_strings~0.base, 40 + ~#type_strings~0.offset, 8);call write~init~$Pointer$(20, 0, ~#type_strings~0.base, 48 + ~#type_strings~0.offset, 8);~#fst_ops~0.base, ~#fst_ops~0.offset := 52, 0;call #Ultimate.allocInit(472, 52);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 8 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_open.base, #funAddr~fst_open.offset, ~#fst_ops~0.base, 16 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_close.base, #funAddr~fst_close.offset, ~#fst_ops~0.base, 24 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_start_xmit.base, #funAddr~hdlc_start_xmit.offset, ~#fst_ops~0.base, 32 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 40 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 48 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 56 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 64 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 72 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_ioctl.base, #funAddr~fst_ioctl.offset, ~#fst_ops~0.base, 80 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 88 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset, ~#fst_ops~0.base, 96 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 104 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_tx_timeout.base, #funAddr~fst_tx_timeout.offset, ~#fst_ops~0.base, 112 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 120 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 128 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 136 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 144 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 152 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 160 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 168 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 176 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 184 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 192 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 200 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 208 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 216 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 224 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 232 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 240 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 248 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 256 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 264 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 272 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 280 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 288 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 296 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 304 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 312 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 320 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 328 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 336 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 344 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 352 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 360 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 368 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 376 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 384 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 392 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 400 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 408 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 416 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 424 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 432 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 440 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 448 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 456 + ~#fst_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_ops~0.base, 464 + ~#fst_ops~0.offset, 8);~#fst_driver~0.base, ~#fst_driver~0.offset := 53, 0;call #Ultimate.allocInit(301, 53);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 8 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(36, 0, ~#fst_driver~0.base, 16 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(~#fst_pci_dev_id~0.base, ~#fst_pci_dev_id~0.offset, ~#fst_driver~0.base, 24 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_add_one.base, #funAddr~fst_add_one.offset, ~#fst_driver~0.base, 32 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~fst_remove_one.base, #funAddr~fst_remove_one.offset, ~#fst_driver~0.base, 40 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 48 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 56 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 64 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 72 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 80 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 88 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 96 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 104 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 112 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 120 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 128 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 136 + ~#fst_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 137 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 145 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 153 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 161 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 169 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 177 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 185 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 193 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 201 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 209 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 217 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 221 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 225 + ~#fst_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 229 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 237 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 245 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 253 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 261 + ~#fst_driver~0.offset, 8);call write~init~int(0, ~#fst_driver~0.base, 269 + ~#fst_driver~0.offset, 4);call write~init~int(0, ~#fst_driver~0.base, 273 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 285 + ~#fst_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#fst_driver~0.base, 293 + ~#fst_driver~0.offset, 8);~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := 0, 0;~ldv_0_line_line~0 := 0;~ldv_0_ret_val_default~0 := 0;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0;~ldv_12_ret_default~0 := 0;~ldv_1_container_net_device~0.base, ~ldv_1_container_net_device~0.offset := 0, 0;~ldv_1_container_struct_ifreq_ptr~0.base, ~ldv_1_container_struct_ifreq_ptr~0.offset := 0, 0;~ldv_1_container_struct_sk_buff_ptr~0.base, ~ldv_1_container_struct_sk_buff_ptr~0.offset := 0, 0;~ldv_1_ldv_param_3_1_default~0 := 0;~ldv_1_ldv_param_9_2_default~0 := 0;~ldv_2_container_pci_driver~0.base, ~ldv_2_container_pci_driver~0.offset := 0, 0;~ldv_2_resource_dev~0.base, ~ldv_2_resource_dev~0.offset := 0, 0;~#ldv_2_resource_pm_message~0.base, ~#ldv_2_resource_pm_message~0.offset := 54, 0;call #Ultimate.allocInit(4, 54);call write~init~int(0, ~#ldv_2_resource_pm_message~0.base, ~#ldv_2_resource_pm_message~0.offset, 4);~ldv_2_resource_struct_pci_device_id_ptr~0.base, ~ldv_2_resource_struct_pci_device_id_ptr~0.offset := 0, 0;~ldv_2_ret_default~0 := 0;~ldv_3_ldv_param_9_0_default~0 := 0;~ldv_3_ret_default~0 := 0;~ldv_4_ldv_param_9_0_default~0 := 0;~ldv_4_ret_default~0 := 0;~ldv_statevar_0~0 := 0;~ldv_statevar_1~0 := 0;~ldv_statevar_12~0 := 0;~ldv_statevar_2~0 := 0;~ldv_statevar_3~0 := 0;~ldv_statevar_4~0 := 0;~ldv_0_callback_handler~0.base, ~ldv_0_callback_handler~0.offset := #funAddr~fst_intr.base, #funAddr~fst_intr.offset;~ldv_12_exit_fst_cleanup_module_default~0.base, ~ldv_12_exit_fst_cleanup_module_default~0.offset := #funAddr~fst_cleanup_module.base, #funAddr~fst_cleanup_module.offset;~ldv_12_init_fst_init_default~0.base, ~ldv_12_init_fst_init_default~0.offset := #funAddr~fst_init.base, #funAddr~fst_init.offset;~ldv_1_callback_ndo_change_mtu~0.base, ~ldv_1_callback_ndo_change_mtu~0.offset := #funAddr~hdlc_change_mtu.base, #funAddr~hdlc_change_mtu.offset;~ldv_1_callback_ndo_do_ioctl~0.base, ~ldv_1_callback_ndo_do_ioctl~0.offset := #funAddr~fst_ioctl.base, #funAddr~fst_ioctl.offset;~ldv_1_callback_ndo_start_xmit~0.base, ~ldv_1_callback_ndo_start_xmit~0.offset := #funAddr~hdlc_start_xmit.base, #funAddr~hdlc_start_xmit.offset;~ldv_1_callback_ndo_stop~0.base, ~ldv_1_callback_ndo_stop~0.offset := #funAddr~fst_close.base, #funAddr~fst_close.offset;~ldv_1_callback_ndo_tx_timeout~0.base, ~ldv_1_callback_ndo_tx_timeout~0.offset := #funAddr~fst_tx_timeout.base, #funAddr~fst_tx_timeout.offset;~ldv_3_callback_func~0.base, ~ldv_3_callback_func~0.offset := #funAddr~fst_process_int_work_q.base, #funAddr~fst_process_int_work_q.offset;~ldv_4_callback_func~0.base, ~ldv_4_callback_func~0.offset := #funAddr~fst_process_tx_work_q.base, #funAddr~fst_process_tx_work_q.offset;~ldv_spin__xmit_lock_of_netdev_queue~0 := 1;~ldv_spin_addr_list_lock_of_net_device~0 := 1;~ldv_spin_alloc_lock_of_task_struct~0 := 1;~ldv_spin_card_lock_of_fst_card_info~0 := 1;~ldv_spin_fst_work_q_lock~0 := 1;~ldv_spin_i_lock_of_inode~0 := 1;~ldv_spin_lock~0 := 1;~ldv_spin_lock_of_NOT_ARG_SIGN~0 := 1;~ldv_spin_lru_lock_of_netns_frags~0 := 1;~ldv_spin_node_size_lock_of_pglist_data~0 := 1;~ldv_spin_ptl~0 := 1;~ldv_spin_siglock_of_sighand_struct~0 := 1;~ldv_spin_tx_global_lock_of_net_device~0 := 1; {22391#true} is VALID [2022-02-20 22:49:42,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {22391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret855#1, main_~tmp~49#1;havoc main_~tmp~49#1;assume { :begin_inline_ldv_initialize } true; {22391#true} is VALID [2022-02-20 22:49:42,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {22391#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_initialize_external_data } true;assume { :begin_inline_ldv_allocate_external_0 } true;havoc ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset, ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset, ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset, ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset, ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,430 INFO L272 TraceCheckUtils]: 3: Hoare triple {22391#true} call ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset := ldv_malloc(0); {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:42,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,430 INFO L272 TraceCheckUtils]: 5: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,432 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22391#true} {22391#true} #4164#return; {22391#true} is VALID [2022-02-20 22:49:42,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {22391#true} ~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset;havoc ldv_allocate_external_0_#t~ret842#1.base, ldv_allocate_external_0_#t~ret842#1.offset;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,432 INFO L272 TraceCheckUtils]: 14: Hoare triple {22391#true} call ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset := ldv_malloc(3027); {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:42,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,433 INFO L272 TraceCheckUtils]: 16: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,433 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,434 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22391#true} {22391#true} #4166#return; {22391#true} is VALID [2022-02-20 22:49:42,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {22391#true} ~ldv_1_container_net_device~0.base, ~ldv_1_container_net_device~0.offset := ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset;havoc ldv_allocate_external_0_#t~ret843#1.base, ldv_allocate_external_0_#t~ret843#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,438 INFO L272 TraceCheckUtils]: 25: Hoare triple {22391#true} call ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset := ldv_malloc(37); {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:42,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,438 INFO L272 TraceCheckUtils]: 27: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,439 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,440 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22391#true} {22391#true} #4168#return; {22391#true} is VALID [2022-02-20 22:49:42,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {22391#true} ~ldv_1_container_struct_ifreq_ptr~0.base, ~ldv_1_container_struct_ifreq_ptr~0.offset := ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset;havoc ldv_allocate_external_0_#t~ret844#1.base, ldv_allocate_external_0_#t~ret844#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,440 INFO L272 TraceCheckUtils]: 36: Hoare triple {22391#true} call ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset := ldv_malloc(245); {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:42,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,441 INFO L272 TraceCheckUtils]: 38: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,441 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,442 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22391#true} {22391#true} #4170#return; {22391#true} is VALID [2022-02-20 22:49:42,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {22391#true} ~ldv_1_container_struct_sk_buff_ptr~0.base, ~ldv_1_container_struct_sk_buff_ptr~0.offset := ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset;havoc ldv_allocate_external_0_#t~ret845#1.base, ldv_allocate_external_0_#t~ret845#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,443 INFO L272 TraceCheckUtils]: 47: Hoare triple {22391#true} call ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset := ldv_malloc(3018); {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:49:42,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {22446#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~1.base, ~res~1.offset;havoc ~tmp~79.base, ~tmp~79.offset;havoc ~tmp___0~29;havoc ~tmp___1~14; {22391#true} is VALID [2022-02-20 22:49:42,443 INFO L272 TraceCheckUtils]: 49: Hoare triple {22391#true} call #t~ret969 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,443 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22391#true} {22391#true} #3850#return; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {22391#true} assume -2147483648 <= #t~ret969 && #t~ret969 <= 2147483647;~tmp___1~14 := #t~ret969;havoc #t~ret969; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {22391#true} assume !(0 != ~tmp___1~14);#res.base, #res.offset := 0, 0; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {22391#true} {22391#true} #4172#return; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {22391#true} ~ldv_2_resource_dev~0.base, ~ldv_2_resource_dev~0.offset := ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset;havoc ldv_allocate_external_0_#t~ret846#1.base, ldv_allocate_external_0_#t~ret846#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {22391#true} assume { :end_inline_ldv_allocate_external_0 } true; {22391#true} is VALID [2022-02-20 22:49:42,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {22391#true} assume { :end_inline_ldv_initialize_external_data } true;~ldv_statevar_12~0 := 9;~ldv_statevar_0~0 := 6;~ldv_statevar_1~0 := 5;~ldv_2_ret_default~0 := 1;~ldv_statevar_2~0 := 20;~ldv_3_ret_default~0 := 1;~ldv_statevar_3~0 := 19;~ldv_4_ret_default~0 := 1;~ldv_statevar_4~0 := 19; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,445 INFO L272 TraceCheckUtils]: 60: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} call main_#t~ret855#1 := ldv_undef_int(); {22391#true} is VALID [2022-02-20 22:49:42,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {22391#true} havoc ~tmp~84;assume -2147483648 <= #t~nondet980 && #t~nondet980 <= 2147483647;~tmp~84 := #t~nondet980;havoc #t~nondet980;#res := ~tmp~84; {22391#true} is VALID [2022-02-20 22:49:42,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,446 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22391#true} {22438#(= 5 ~ldv_statevar_1~0)} #4174#return; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume -2147483648 <= main_#t~ret855#1 && main_#t~ret855#1 <= 2147483647;main_~tmp~49#1 := main_#t~ret855#1;havoc main_#t~ret855#1; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(0 == main_~tmp~49#1); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(1 == main_~tmp~49#1); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume 2 == main_~tmp~49#1; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume { :begin_inline_ldv_net_dummy_resourceless_instance_1 } true;ldv_net_dummy_resourceless_instance_1_#in~arg0#1.base, ldv_net_dummy_resourceless_instance_1_#in~arg0#1.offset := 0, 0;havoc ldv_net_dummy_resourceless_instance_1_#t~ret862#1, ldv_net_dummy_resourceless_instance_1_#t~ret863#1, ldv_net_dummy_resourceless_instance_1_#t~ret864#1, ldv_net_dummy_resourceless_instance_1_~arg0#1.base, ldv_net_dummy_resourceless_instance_1_~arg0#1.offset, ldv_net_dummy_resourceless_instance_1_~tmp~52#1, ldv_net_dummy_resourceless_instance_1_~tmp___0~20#1;ldv_net_dummy_resourceless_instance_1_~arg0#1.base, ldv_net_dummy_resourceless_instance_1_~arg0#1.offset := ldv_net_dummy_resourceless_instance_1_#in~arg0#1.base, ldv_net_dummy_resourceless_instance_1_#in~arg0#1.offset;havoc ldv_net_dummy_resourceless_instance_1_~tmp~52#1;havoc ldv_net_dummy_resourceless_instance_1_~tmp___0~20#1; {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(1 == ~ldv_statevar_1~0); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,449 INFO L290 TraceCheckUtils]: 70: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(2 == ~ldv_statevar_1~0); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(3 == ~ldv_statevar_1~0); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(4 == ~ldv_statevar_1~0); {22438#(= 5 ~ldv_statevar_1~0)} is VALID [2022-02-20 22:49:42,450 INFO L290 TraceCheckUtils]: 73: Hoare triple {22438#(= 5 ~ldv_statevar_1~0)} assume !(5 == ~ldv_statevar_1~0); {22392#false} is VALID [2022-02-20 22:49:42,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {22392#false} assume !(7 == ~ldv_statevar_1~0); {22392#false} is VALID [2022-02-20 22:49:42,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {22392#false} assume !(10 == ~ldv_statevar_1~0); {22392#false} is VALID [2022-02-20 22:49:42,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {22392#false} assume !(12 == ~ldv_statevar_1~0); {22392#false} is VALID [2022-02-20 22:49:42,450 INFO L290 TraceCheckUtils]: 77: Hoare triple {22392#false} assume !(13 == ~ldv_statevar_1~0); {22392#false} is VALID [2022-02-20 22:49:42,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {22392#false} assume 14 == ~ldv_statevar_1~0; {22392#false} is VALID [2022-02-20 22:49:42,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {22392#false} assume { :begin_inline_ldv_dummy_resourceless_instance_callback_1_14 } true;ldv_dummy_resourceless_instance_callback_1_14_#in~arg0#1.base, ldv_dummy_resourceless_instance_callback_1_14_#in~arg0#1.offset, ldv_dummy_resourceless_instance_callback_1_14_#in~arg1#1.base, ldv_dummy_resourceless_instance_callback_1_14_#in~arg1#1.offset := ~ldv_1_callback_ndo_tx_timeout~0.base, ~ldv_1_callback_ndo_tx_timeout~0.offset, ~ldv_1_container_net_device~0.base, ~ldv_1_container_net_device~0.offset;havoc ldv_dummy_resourceless_instance_callback_1_14_~arg0#1.base, ldv_dummy_resourceless_instance_callback_1_14_~arg0#1.offset, ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.base, ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.offset;ldv_dummy_resourceless_instance_callback_1_14_~arg0#1.base, ldv_dummy_resourceless_instance_callback_1_14_~arg0#1.offset := ldv_dummy_resourceless_instance_callback_1_14_#in~arg0#1.base, ldv_dummy_resourceless_instance_callback_1_14_#in~arg0#1.offset;ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.base, ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.offset := ldv_dummy_resourceless_instance_callback_1_14_#in~arg1#1.base, ldv_dummy_resourceless_instance_callback_1_14_#in~arg1#1.offset; {22392#false} is VALID [2022-02-20 22:49:42,451 INFO L272 TraceCheckUtils]: 80: Hoare triple {22392#false} call fst_tx_timeout(ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.base, ldv_dummy_resourceless_instance_callback_1_14_~arg1#1.offset); {22392#false} is VALID [2022-02-20 22:49:42,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {22392#false} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;havoc ~port~6.base, ~port~6.offset;havoc ~card~6.base, ~card~6.offset;havoc ~tmp~41.base, ~tmp~41.offset; {22392#false} is VALID [2022-02-20 22:49:42,451 INFO L272 TraceCheckUtils]: 82: Hoare triple {22392#false} call #t~ret727.base, #t~ret727.offset := dev_to_hdlc(~dev.base, ~dev.offset); {22391#true} is VALID [2022-02-20 22:49:42,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {22391#true} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;havoc ~tmp~21#1.base, ~tmp~21#1.offset;assume { :begin_inline_netdev_priv } true;netdev_priv_#in~dev#1.base, netdev_priv_#in~dev#1.offset := ~dev#1.base, ~dev#1.offset;havoc netdev_priv_#res#1.base, netdev_priv_#res#1.offset;havoc netdev_priv_~dev#1.base, netdev_priv_~dev#1.offset;netdev_priv_~dev#1.base, netdev_priv_~dev#1.offset := netdev_priv_#in~dev#1.base, netdev_priv_#in~dev#1.offset;netdev_priv_#res#1.base, netdev_priv_#res#1.offset := netdev_priv_~dev#1.base, 3200 + netdev_priv_~dev#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {22391#true} #t~ret164#1.base, #t~ret164#1.offset := netdev_priv_#res#1.base, netdev_priv_#res#1.offset;assume { :end_inline_netdev_priv } true;~tmp~21#1.base, ~tmp~21#1.offset := #t~ret164#1.base, #t~ret164#1.offset;havoc #t~ret164#1.base, #t~ret164#1.offset;#res#1.base, #res#1.offset := ~tmp~21#1.base, ~tmp~21#1.offset; {22391#true} is VALID [2022-02-20 22:49:42,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {22391#true} assume true; {22391#true} is VALID [2022-02-20 22:49:42,452 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22391#true} {22392#false} #4048#return; {22392#false} is VALID [2022-02-20 22:49:42,452 INFO L290 TraceCheckUtils]: 87: Hoare triple {22392#false} ~tmp~41.base, ~tmp~41.offset := #t~ret727.base, #t~ret727.offset;havoc #t~ret727.base, #t~ret727.offset;call #t~mem728.base, #t~mem728.offset := read~$Pointer$(~tmp~41.base, 108 + ~tmp~41.offset, 8);~port~6.base, ~port~6.offset := #t~mem728.base, #t~mem728.offset;havoc #t~mem728.base, #t~mem728.offset;call #t~mem729.base, #t~mem729.offset := read~$Pointer$(~port~6.base, 8 + ~port~6.offset, 8);~card~6.base, ~card~6.offset := #t~mem729.base, #t~mem729.offset;havoc #t~mem729.base, #t~mem729.offset;call #t~mem730 := read~int(~dev.base, 300 + ~dev.offset, 8);call write~int(1 + #t~mem730, ~dev.base, 300 + ~dev.offset, 8);havoc #t~mem730;call #t~mem731 := read~int(~dev.base, 388 + ~dev.offset, 8);call write~int(1 + #t~mem731, ~dev.base, 388 + ~dev.offset, 8);havoc #t~mem731; {22392#false} is VALID [2022-02-20 22:49:42,452 INFO L272 TraceCheckUtils]: 88: Hoare triple {22392#false} call fst_issue_cmd(~port~6.base, ~port~6.offset, 5); {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {22392#false} ~port#1.base, ~port#1.offset := #in~port#1.base, #in~port#1.offset;~cmd#1 := #in~cmd#1;havoc ~card~0#1.base, ~card~0#1.offset;havoc ~mbval~0#1;havoc ~flags~3#1;havoc ~safety~0#1;call #t~mem254#1.base, #t~mem254#1.offset := read~$Pointer$(~port#1.base, 8 + ~port#1.offset, 8);~card~0#1.base, ~card~0#1.offset := #t~mem254#1.base, #t~mem254#1.offset;havoc #t~mem254#1.base, #t~mem254#1.offset;assume { :begin_inline_ldv___ldv_spin_lock_66 } true;ldv___ldv_spin_lock_66_#in~ldv_func_arg1#1.base, ldv___ldv_spin_lock_66_#in~ldv_func_arg1#1.offset := ~card~0#1.base, 40 + ~card~0#1.offset;havoc ldv___ldv_spin_lock_66_~ldv_func_arg1#1.base, ldv___ldv_spin_lock_66_~ldv_func_arg1#1.offset;ldv___ldv_spin_lock_66_~ldv_func_arg1#1.base, ldv___ldv_spin_lock_66_~ldv_func_arg1#1.offset := ldv___ldv_spin_lock_66_#in~ldv_func_arg1#1.base, ldv___ldv_spin_lock_66_#in~ldv_func_arg1#1.offset; {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L272 TraceCheckUtils]: 90: Hoare triple {22392#false} call ldv_spin_lock_card_lock_of_fst_card_info(); {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L272 TraceCheckUtils]: 91: Hoare triple {22392#false} call ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock((if 1 == ~ldv_spin_card_lock_of_fst_card_info~0 then 1 else 0)); {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {22392#false} ~expr := #in~expr; {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {22392#false} assume 0 == ~expr; {22392#false} is VALID [2022-02-20 22:49:42,453 INFO L290 TraceCheckUtils]: 94: Hoare triple {22392#false} assume !false; {22392#false} is VALID [2022-02-20 22:49:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-02-20 22:49:42,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:49:42,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250410730] [2022-02-20 22:49:42,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250410730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:49:42,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:49:42,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:49:42,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694595071] [2022-02-20 22:49:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:49:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-02-20 22:49:42,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:49:42,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:49:42,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:49:42,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:49:42,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:49:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:49:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:49:42,523 INFO L87 Difference]: Start difference. First operand 3588 states and 5049 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:50:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:50:01,642 INFO L93 Difference]: Finished difference Result 9924 states and 13928 transitions. [2022-02-20 22:50:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:50:01,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-02-20 22:50:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:50:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:50:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7164 transitions. [2022-02-20 22:50:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 22:50:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7164 transitions. [2022-02-20 22:50:02,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 7164 transitions. [2022-02-20 22:50:07,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7164 edges. 7164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:50:09,338 INFO L225 Difference]: With dead ends: 9924 [2022-02-20 22:50:09,338 INFO L226 Difference]: Without dead ends: 6351 [2022-02-20 22:50:09,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:50:09,351 INFO L933 BasicCegarLoop]: 2683 mSDtfsCounter, 2519 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1263 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:50:09,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2868 Valid, 5175 Invalid, 3316 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1263 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-02-20 22:50:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2022-02-20 22:50:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 6285. [2022-02-20 22:50:09,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:50:09,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6351 states. Second operand has 6285 states, 4346 states have (on average 1.286470317533364) internal successors, (5591), 4398 states have internal predecessors, (5591), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) [2022-02-20 22:50:09,542 INFO L74 IsIncluded]: Start isIncluded. First operand 6351 states. Second operand has 6285 states, 4346 states have (on average 1.286470317533364) internal successors, (5591), 4398 states have internal predecessors, (5591), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) [2022-02-20 22:50:09,557 INFO L87 Difference]: Start difference. First operand 6351 states. Second operand has 6285 states, 4346 states have (on average 1.286470317533364) internal successors, (5591), 4398 states have internal predecessors, (5591), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) [2022-02-20 22:50:10,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:50:10,840 INFO L93 Difference]: Finished difference Result 6351 states and 8889 transitions. [2022-02-20 22:50:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 8889 transitions. [2022-02-20 22:50:10,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:50:10,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:50:10,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 6285 states, 4346 states have (on average 1.286470317533364) internal successors, (5591), 4398 states have internal predecessors, (5591), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) Second operand 6351 states. [2022-02-20 22:50:10,888 INFO L87 Difference]: Start difference. First operand has 6285 states, 4346 states have (on average 1.286470317533364) internal successors, (5591), 4398 states have internal predecessors, (5591), 1599 states have call successors, (1599), 338 states have call predecessors, (1599), 337 states have return successors, (1601), 1580 states have call predecessors, (1601), 1595 states have call successors, (1601) Second operand 6351 states.