./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:31:47,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:31:47,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:31:47,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:31:47,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:31:47,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:31:47,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:31:47,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:31:47,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:31:47,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:31:47,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:31:47,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:31:47,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:31:47,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:31:47,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:31:47,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:31:47,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:31:47,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2025-01-09 20:31:47,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:31:47,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:31:47,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:31:47,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:31:47,768 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:31:47,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-01-09 20:31:48,959 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/632606aef/ae952a09667d4d239ec07d6912bd75fc/FLAG0a25f7ba6 [2025-01-09 20:31:49,484 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:31:49,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-01-09 20:31:49,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/632606aef/ae952a09667d4d239ec07d6912bd75fc/FLAG0a25f7ba6 [2025-01-09 20:31:49,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/632606aef/ae952a09667d4d239ec07d6912bd75fc [2025-01-09 20:31:49,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:31:49,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:31:49,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:31:49,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:31:49,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:31:49,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:31:49" (1/1) ... [2025-01-09 20:31:49,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ead840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:49, skipping insertion in model container [2025-01-09 20:31:49,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:31:49" (1/1) ... [2025-01-09 20:31:49,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:31:51,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2025-01-09 20:31:51,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2025-01-09 20:31:51,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2025-01-09 20:31:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2025-01-09 20:31:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2025-01-09 20:31:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2025-01-09 20:31:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2025-01-09 20:31:51,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2025-01-09 20:31:51,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2025-01-09 20:31:51,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2025-01-09 20:31:51,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2025-01-09 20:31:51,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2025-01-09 20:31:51,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2025-01-09 20:31:51,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2025-01-09 20:31:51,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2025-01-09 20:31:51,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2025-01-09 20:31:51,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2025-01-09 20:31:51,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2025-01-09 20:31:51,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2025-01-09 20:31:51,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2025-01-09 20:31:51,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2025-01-09 20:31:51,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2025-01-09 20:31:51,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2025-01-09 20:31:51,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2025-01-09 20:31:51,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2025-01-09 20:31:51,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2025-01-09 20:31:51,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2025-01-09 20:31:51,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2025-01-09 20:31:51,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2025-01-09 20:31:51,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2025-01-09 20:31:51,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2025-01-09 20:31:51,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2025-01-09 20:31:51,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2025-01-09 20:31:51,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2025-01-09 20:31:51,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2025-01-09 20:31:51,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2025-01-09 20:31:51,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2025-01-09 20:31:51,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2025-01-09 20:31:51,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2025-01-09 20:31:51,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2025-01-09 20:31:51,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2025-01-09 20:31:51,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2025-01-09 20:31:51,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2025-01-09 20:31:51,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2025-01-09 20:31:51,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2025-01-09 20:31:51,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2025-01-09 20:31:51,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2025-01-09 20:31:51,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2025-01-09 20:31:51,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2025-01-09 20:31:51,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2025-01-09 20:31:51,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2025-01-09 20:31:51,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2025-01-09 20:31:51,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2025-01-09 20:31:51,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2025-01-09 20:31:51,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2025-01-09 20:31:51,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2025-01-09 20:31:51,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2025-01-09 20:31:51,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2025-01-09 20:31:51,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2025-01-09 20:31:51,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2025-01-09 20:31:51,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2025-01-09 20:31:51,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2025-01-09 20:31:51,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2025-01-09 20:31:51,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2025-01-09 20:31:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2025-01-09 20:31:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2025-01-09 20:31:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2025-01-09 20:31:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2025-01-09 20:31:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2025-01-09 20:31:51,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2025-01-09 20:31:51,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2025-01-09 20:31:51,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2025-01-09 20:31:51,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:31:51,994 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:31:52,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4177] [2025-01-09 20:31:52,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4184] [2025-01-09 20:31:52,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [4191] [2025-01-09 20:31:52,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2025-01-09 20:31:52,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2025-01-09 20:31:52,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2025-01-09 20:31:52,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2025-01-09 20:31:52,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2025-01-09 20:31:52,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2025-01-09 20:31:52,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2025-01-09 20:31:52,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2025-01-09 20:31:52,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2025-01-09 20:31:52,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2025-01-09 20:31:52,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2025-01-09 20:31:52,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2025-01-09 20:31:52,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2025-01-09 20:31:52,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2025-01-09 20:31:52,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2025-01-09 20:31:52,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2025-01-09 20:31:52,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2025-01-09 20:31:52,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2025-01-09 20:31:52,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2025-01-09 20:31:52,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2025-01-09 20:31:52,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2025-01-09 20:31:52,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2025-01-09 20:31:52,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2025-01-09 20:31:52,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2025-01-09 20:31:52,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2025-01-09 20:31:52,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2025-01-09 20:31:52,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2025-01-09 20:31:52,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2025-01-09 20:31:52,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2025-01-09 20:31:52,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2025-01-09 20:31:52,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2025-01-09 20:31:52,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2025-01-09 20:31:52,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2025-01-09 20:31:52,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2025-01-09 20:31:52,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2025-01-09 20:31:52,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2025-01-09 20:31:52,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2025-01-09 20:31:52,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2025-01-09 20:31:52,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2025-01-09 20:31:52,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2025-01-09 20:31:52,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2025-01-09 20:31:52,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2025-01-09 20:31:52,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2025-01-09 20:31:52,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2025-01-09 20:31:52,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2025-01-09 20:31:52,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2025-01-09 20:31:52,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2025-01-09 20:31:52,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2025-01-09 20:31:52,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2025-01-09 20:31:52,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2025-01-09 20:31:52,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2025-01-09 20:31:52,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2025-01-09 20:31:52,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2025-01-09 20:31:52,221 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2025-01-09 20:31:52,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2025-01-09 20:31:52,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2025-01-09 20:31:52,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2025-01-09 20:31:52,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2025-01-09 20:31:52,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2025-01-09 20:31:52,268 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2025-01-09 20:31:52,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2025-01-09 20:31:52,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:31:52,359 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:31:52,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52 WrapperNode [2025-01-09 20:31:52,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:31:52,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:31:52,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:31:52,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:31:52,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,520 INFO L138 Inliner]: procedures = 592, calls = 1952, calls flagged for inlining = 265, calls inlined = 171, statements flattened = 3426 [2025-01-09 20:31:52,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:31:52,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:31:52,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:31:52,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:31:52,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,921 INFO L175 MemorySlicer]: Split 593 memory accesses to 24 slices as follows [3, 10, 8, 8, 7, 8, 2, 8, 8, 8, 31, 8, 2, 4, 1, 2, 49, 23, 8, 56, 4, 22, 8, 305]. 51 percent of accesses are in the largest equivalence class. The 181 initializations are split as follows [0, 10, 8, 8, 0, 8, 0, 8, 8, 8, 0, 8, 0, 0, 1, 2, 0, 0, 8, 56, 4, 0, 8, 36]. The 239 writes are split as follows [0, 0, 0, 0, 6, 0, 1, 0, 0, 0, 31, 0, 0, 1, 0, 0, 42, 23, 0, 0, 0, 22, 0, 113]. [2025-01-09 20:31:52,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:52,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:31:53,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:31:53,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:31:53,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:31:53,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (1/1) ... [2025-01-09 20:31:53,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:31:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:31:53,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:31:53,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:31:53,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:31:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:31:53,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 20:31:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 20:31:53,219 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-01-09 20:31:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-01-09 20:31:53,219 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-01-09 20:31:53,219 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-01-09 20:31:53,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:31:53,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:31:53,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:31:53,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:31:53,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 20:31:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-01-09 20:31:53,222 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-01-09 20:31:53,223 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-01-09 20:31:53,224 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-01-09 20:31:53,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-01-09 20:31:53,225 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-01-09 20:31:53,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:31:53,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:31:53,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-01-09 20:31:53,229 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 20:31:53,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 20:31:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 20:31:53,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:31:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:31:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-01-09 20:31:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-01-09 20:31:53,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2025-01-09 20:31:53,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-01-09 20:31:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 20:31:53,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 20:31:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 20:31:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 20:31:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:31:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 20:31:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 20:31:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 20:31:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 20:31:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 20:31:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 20:31:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:31:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:31:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 20:31:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-01-09 20:31:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2025-01-09 20:31:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2025-01-09 20:31:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2025-01-09 20:31:53,795 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:31:53,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:31:53,825 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:32:02,630 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2025-01-09 20:32:02,630 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:32:02,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:32:02,674 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 20:32:02,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:02 BoogieIcfgContainer [2025-01-09 20:32:02,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:32:02,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:32:02,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:32:02,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:32:02,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:31:49" (1/3) ... [2025-01-09 20:32:02,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6049a4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:02, skipping insertion in model container [2025-01-09 20:32:02,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:31:52" (2/3) ... [2025-01-09 20:32:02,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6049a4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:02, skipping insertion in model container [2025-01-09 20:32:02,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:02" (3/3) ... [2025-01-09 20:32:02,683 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2025-01-09 20:32:02,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:32:02,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i that has 98 procedures, 1414 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-01-09 20:32:02,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:32:02,789 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e9b434d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:32:02,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-09 20:32:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 1413 states, 887 states have (on average 1.2525366403607667) internal successors, (1111), 941 states have internal predecessors, (1111), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 391 states have call predecessors, (394), 394 states have call successors, (394) [2025-01-09 20:32:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:32:02,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:02,894 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:02,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:02,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 259012346, now seen corresponding path program 1 times [2025-01-09 20:32:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:02,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518285528] [2025-01-09 20:32:02,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:04,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:32:04,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:32:04,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:04,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:05,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:05,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518285528] [2025-01-09 20:32:05,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518285528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:05,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:05,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681256007] [2025-01-09 20:32:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:05,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:05,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:05,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:05,166 INFO L87 Difference]: Start difference. First operand has 1413 states, 887 states have (on average 1.2525366403607667) internal successors, (1111), 941 states have internal predecessors, (1111), 399 states have call successors, (399), 97 states have call predecessors, (399), 96 states have return successors, (394), 391 states have call predecessors, (394), 394 states have call successors, (394) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:05,386 INFO L93 Difference]: Finished difference Result 2759 states and 3865 transitions. [2025-01-09 20:32:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:05,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-01-09 20:32:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:05,405 INFO L225 Difference]: With dead ends: 2759 [2025-01-09 20:32:05,406 INFO L226 Difference]: Without dead ends: 1395 [2025-01-09 20:32:05,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:05,417 INFO L435 NwaCegarLoop]: 1863 mSDtfsCounter, 1833 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 3725 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:05,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1833 Valid, 3725 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-01-09 20:32:05,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395. [2025-01-09 20:32:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 877 states have (on average 1.209806157354618) internal successors, (1061), 926 states have internal predecessors, (1061), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1847 transitions. [2025-01-09 20:32:05,563 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1847 transitions. Word has length 71 [2025-01-09 20:32:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:05,565 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1847 transitions. [2025-01-09 20:32:05,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1847 transitions. [2025-01-09 20:32:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 20:32:05,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:05,569 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:05,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:32:05,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:05,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash -618618339, now seen corresponding path program 1 times [2025-01-09 20:32:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740037958] [2025-01-09 20:32:05,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:06,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 20:32:06,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 20:32:06,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:07,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740037958] [2025-01-09 20:32:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740037958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:07,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:07,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756403642] [2025-01-09 20:32:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:07,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:07,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:07,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:07,295 INFO L87 Difference]: Start difference. First operand 1395 states and 1847 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:07,454 INFO L93 Difference]: Finished difference Result 1395 states and 1847 transitions. [2025-01-09 20:32:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-01-09 20:32:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:07,466 INFO L225 Difference]: With dead ends: 1395 [2025-01-09 20:32:07,466 INFO L226 Difference]: Without dead ends: 1393 [2025-01-09 20:32:07,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:07,468 INFO L435 NwaCegarLoop]: 1843 mSDtfsCounter, 1812 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1812 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:07,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1812 Valid, 3685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-01-09 20:32:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2025-01-09 20:32:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 876 states have (on average 1.2089041095890412) internal successors, (1059), 924 states have internal predecessors, (1059), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1845 transitions. [2025-01-09 20:32:07,545 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1845 transitions. Word has length 77 [2025-01-09 20:32:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:07,547 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1845 transitions. [2025-01-09 20:32:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1845 transitions. [2025-01-09 20:32:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 20:32:07,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:07,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:07,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:32:07,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:07,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1021856508, now seen corresponding path program 1 times [2025-01-09 20:32:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715483485] [2025-01-09 20:32:07,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 20:32:08,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 20:32:08,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:08,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715483485] [2025-01-09 20:32:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715483485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903976226] [2025-01-09 20:32:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:08,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:08,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:08,873 INFO L87 Difference]: Start difference. First operand 1393 states and 1845 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:08,981 INFO L93 Difference]: Finished difference Result 1393 states and 1845 transitions. [2025-01-09 20:32:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-01-09 20:32:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:08,990 INFO L225 Difference]: With dead ends: 1393 [2025-01-09 20:32:08,990 INFO L226 Difference]: Without dead ends: 1391 [2025-01-09 20:32:08,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:08,992 INFO L435 NwaCegarLoop]: 1841 mSDtfsCounter, 1809 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:08,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 3681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-01-09 20:32:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2025-01-09 20:32:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 875 states have (on average 1.208) internal successors, (1057), 922 states have internal predecessors, (1057), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1843 transitions. [2025-01-09 20:32:09,054 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1843 transitions. Word has length 83 [2025-01-09 20:32:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:09,055 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1843 transitions. [2025-01-09 20:32:09,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1843 transitions. [2025-01-09 20:32:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 20:32:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:09,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:32:09,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -553537469, now seen corresponding path program 1 times [2025-01-09 20:32:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984932637] [2025-01-09 20:32:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:10,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 20:32:10,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 20:32:10,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:10,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:10,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:10,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984932637] [2025-01-09 20:32:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984932637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:10,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685567805] [2025-01-09 20:32:10,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:10,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:10,546 INFO L87 Difference]: Start difference. First operand 1391 states and 1843 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:10,655 INFO L93 Difference]: Finished difference Result 1391 states and 1843 transitions. [2025-01-09 20:32:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-01-09 20:32:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:10,665 INFO L225 Difference]: With dead ends: 1391 [2025-01-09 20:32:10,665 INFO L226 Difference]: Without dead ends: 1389 [2025-01-09 20:32:10,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:10,668 INFO L435 NwaCegarLoop]: 1839 mSDtfsCounter, 1806 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:10,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 3677 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-01-09 20:32:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1389. [2025-01-09 20:32:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 874 states have (on average 1.2070938215102975) internal successors, (1055), 920 states have internal predecessors, (1055), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1841 transitions. [2025-01-09 20:32:10,733 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1841 transitions. Word has length 89 [2025-01-09 20:32:10,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:10,733 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1841 transitions. [2025-01-09 20:32:10,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1841 transitions. [2025-01-09 20:32:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 20:32:10,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:10,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:10,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:32:10,736 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:10,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1650418483, now seen corresponding path program 1 times [2025-01-09 20:32:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916975615] [2025-01-09 20:32:10,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:11,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 20:32:11,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 20:32:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916975615] [2025-01-09 20:32:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916975615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:11,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:11,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618409892] [2025-01-09 20:32:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:11,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:11,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:11,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:11,946 INFO L87 Difference]: Start difference. First operand 1389 states and 1841 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:12,057 INFO L93 Difference]: Finished difference Result 1389 states and 1841 transitions. [2025-01-09 20:32:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:12,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-01-09 20:32:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:12,067 INFO L225 Difference]: With dead ends: 1389 [2025-01-09 20:32:12,067 INFO L226 Difference]: Without dead ends: 1387 [2025-01-09 20:32:12,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:12,070 INFO L435 NwaCegarLoop]: 1837 mSDtfsCounter, 1803 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:12,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 3673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-01-09 20:32:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1387. [2025-01-09 20:32:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 873 states have (on average 1.2061855670103092) internal successors, (1053), 918 states have internal predecessors, (1053), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1839 transitions. [2025-01-09 20:32:12,171 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1839 transitions. Word has length 95 [2025-01-09 20:32:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1839 transitions. [2025-01-09 20:32:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1839 transitions. [2025-01-09 20:32:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 20:32:12,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:12,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:12,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:32:12,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1930536529, now seen corresponding path program 1 times [2025-01-09 20:32:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673506778] [2025-01-09 20:32:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:13,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:32:13,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:32:13,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:13,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673506778] [2025-01-09 20:32:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673506778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877572700] [2025-01-09 20:32:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:13,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:13,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:13,583 INFO L87 Difference]: Start difference. First operand 1387 states and 1839 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:13,715 INFO L93 Difference]: Finished difference Result 1387 states and 1839 transitions. [2025-01-09 20:32:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:13,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-01-09 20:32:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:13,724 INFO L225 Difference]: With dead ends: 1387 [2025-01-09 20:32:13,725 INFO L226 Difference]: Without dead ends: 1385 [2025-01-09 20:32:13,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:13,727 INFO L435 NwaCegarLoop]: 1835 mSDtfsCounter, 1800 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:13,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 3669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2025-01-09 20:32:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2025-01-09 20:32:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.2052752293577982) internal successors, (1051), 916 states have internal predecessors, (1051), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1837 transitions. [2025-01-09 20:32:13,801 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1837 transitions. Word has length 101 [2025-01-09 20:32:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:13,801 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1837 transitions. [2025-01-09 20:32:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1837 transitions. [2025-01-09 20:32:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:32:13,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:13,803 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:13,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:32:13,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:13,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:13,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1214396911, now seen corresponding path program 1 times [2025-01-09 20:32:13,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:13,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310999860] [2025-01-09 20:32:13,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:14,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:32:14,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:32:14,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310999860] [2025-01-09 20:32:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310999860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:14,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:14,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608809230] [2025-01-09 20:32:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:14,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:14,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:14,929 INFO L87 Difference]: Start difference. First operand 1385 states and 1837 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:15,050 INFO L93 Difference]: Finished difference Result 1385 states and 1837 transitions. [2025-01-09 20:32:15,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:15,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-01-09 20:32:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:15,057 INFO L225 Difference]: With dead ends: 1385 [2025-01-09 20:32:15,058 INFO L226 Difference]: Without dead ends: 1383 [2025-01-09 20:32:15,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:15,059 INFO L435 NwaCegarLoop]: 1833 mSDtfsCounter, 1797 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 3665 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-01-09 20:32:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-01-09 20:32:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 871 states have (on average 1.2043628013777268) internal successors, (1049), 914 states have internal predecessors, (1049), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1835 transitions. [2025-01-09 20:32:15,127 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1835 transitions. Word has length 107 [2025-01-09 20:32:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:15,128 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1835 transitions. [2025-01-09 20:32:15,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1835 transitions. [2025-01-09 20:32:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 20:32:15,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:15,130 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:15,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:32:15,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:15,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 67516628, now seen corresponding path program 1 times [2025-01-09 20:32:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:15,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571070315] [2025-01-09 20:32:15,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:15,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 20:32:16,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 20:32:16,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:16,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571070315] [2025-01-09 20:32:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571070315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408578850] [2025-01-09 20:32:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:16,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:16,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:16,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:16,408 INFO L87 Difference]: Start difference. First operand 1383 states and 1835 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:16,523 INFO L93 Difference]: Finished difference Result 1383 states and 1835 transitions. [2025-01-09 20:32:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-01-09 20:32:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:16,532 INFO L225 Difference]: With dead ends: 1383 [2025-01-09 20:32:16,532 INFO L226 Difference]: Without dead ends: 1381 [2025-01-09 20:32:16,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:16,534 INFO L435 NwaCegarLoop]: 1831 mSDtfsCounter, 1794 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:16,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 3661 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-01-09 20:32:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-01-09 20:32:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 870 states have (on average 1.203448275862069) internal successors, (1047), 912 states have internal predecessors, (1047), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1833 transitions. [2025-01-09 20:32:16,602 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1833 transitions. Word has length 113 [2025-01-09 20:32:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:16,603 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1833 transitions. [2025-01-09 20:32:16,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1833 transitions. [2025-01-09 20:32:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 20:32:16,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:16,604 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:16,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:32:16,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:16,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash 459121751, now seen corresponding path program 1 times [2025-01-09 20:32:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799771106] [2025-01-09 20:32:16,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:17,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 20:32:17,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 20:32:17,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799771106] [2025-01-09 20:32:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799771106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:17,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:17,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974402603] [2025-01-09 20:32:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:17,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:17,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:17,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:17,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:17,945 INFO L87 Difference]: Start difference. First operand 1381 states and 1833 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:18,114 INFO L93 Difference]: Finished difference Result 1381 states and 1833 transitions. [2025-01-09 20:32:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2025-01-09 20:32:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:18,123 INFO L225 Difference]: With dead ends: 1381 [2025-01-09 20:32:18,123 INFO L226 Difference]: Without dead ends: 1379 [2025-01-09 20:32:18,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:18,126 INFO L435 NwaCegarLoop]: 1829 mSDtfsCounter, 1790 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:18,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 3657 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-01-09 20:32:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2025-01-09 20:32:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 869 states have (on average 1.2025316455696202) internal successors, (1045), 910 states have internal predecessors, (1045), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1831 transitions. [2025-01-09 20:32:18,219 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1831 transitions. Word has length 115 [2025-01-09 20:32:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:18,220 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 1831 transitions. [2025-01-09 20:32:18,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:18,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1831 transitions. [2025-01-09 20:32:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 20:32:18,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:18,222 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:32:18,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:18,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1794358172, now seen corresponding path program 1 times [2025-01-09 20:32:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794356813] [2025-01-09 20:32:18,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:19,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 20:32:19,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 20:32:19,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:19,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794356813] [2025-01-09 20:32:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794356813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:32:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936333416] [2025-01-09 20:32:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:19,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:19,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:19,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:19,267 INFO L87 Difference]: Start difference. First operand 1379 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:19,366 INFO L93 Difference]: Finished difference Result 2546 states and 3357 transitions. [2025-01-09 20:32:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2025-01-09 20:32:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:19,373 INFO L225 Difference]: With dead ends: 2546 [2025-01-09 20:32:19,373 INFO L226 Difference]: Without dead ends: 1375 [2025-01-09 20:32:19,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:19,378 INFO L435 NwaCegarLoop]: 1825 mSDtfsCounter, 1814 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:19,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1814 Valid, 1825 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-01-09 20:32:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2025-01-09 20:32:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 866 states have (on average 1.2009237875288683) internal successors, (1040), 906 states have internal predecessors, (1040), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1826 transitions. [2025-01-09 20:32:19,447 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1826 transitions. Word has length 155 [2025-01-09 20:32:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1826 transitions. [2025-01-09 20:32:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1826 transitions. [2025-01-09 20:32:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 20:32:19,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:19,450 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:32:19,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:19,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash -114925961, now seen corresponding path program 1 times [2025-01-09 20:32:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709067330] [2025-01-09 20:32:19,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 20:32:20,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 20:32:20,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:20,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709067330] [2025-01-09 20:32:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709067330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782037164] [2025-01-09 20:32:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:20,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:20,707 INFO L87 Difference]: Start difference. First operand 1375 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:20,821 INFO L93 Difference]: Finished difference Result 1375 states and 1826 transitions. [2025-01-09 20:32:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2025-01-09 20:32:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:20,830 INFO L225 Difference]: With dead ends: 1375 [2025-01-09 20:32:20,830 INFO L226 Difference]: Without dead ends: 1373 [2025-01-09 20:32:20,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:20,831 INFO L435 NwaCegarLoop]: 1822 mSDtfsCounter, 1784 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:20,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 3643 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-01-09 20:32:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2025-01-09 20:32:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 865 states have (on average 1.2) internal successors, (1038), 904 states have internal predecessors, (1038), 394 states have call successors, (394), 96 states have call predecessors, (394), 95 states have return successors, (392), 389 states have call predecessors, (392), 392 states have call successors, (392) [2025-01-09 20:32:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1824 transitions. [2025-01-09 20:32:20,938 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1824 transitions. Word has length 121 [2025-01-09 20:32:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:20,939 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1824 transitions. [2025-01-09 20:32:20,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1824 transitions. [2025-01-09 20:32:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:32:20,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:20,942 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:20,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:32:20,942 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1347862726, now seen corresponding path program 1 times [2025-01-09 20:32:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136403568] [2025-01-09 20:32:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:22,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:32:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:32:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-01-09 20:32:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136403568] [2025-01-09 20:32:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136403568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743806200] [2025-01-09 20:32:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:22,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:22,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:22,691 INFO L87 Difference]: Start difference. First operand 1373 states and 1824 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:22,946 INFO L93 Difference]: Finished difference Result 1601 states and 2051 transitions. [2025-01-09 20:32:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-01-09 20:32:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:22,953 INFO L225 Difference]: With dead ends: 1601 [2025-01-09 20:32:22,953 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 20:32:22,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:22,953 INFO L435 NwaCegarLoop]: 1911 mSDtfsCounter, 1604 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 6124 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:22,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 6124 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:32:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 20:32:23,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1585. [2025-01-09 20:32:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1004 states have (on average 1.1872509960159363) internal successors, (1192), 1043 states have internal predecessors, (1192), 426 states have call successors, (426), 137 states have call predecessors, (426), 136 states have return successors, (424), 421 states have call predecessors, (424), 424 states have call successors, (424) [2025-01-09 20:32:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2042 transitions. [2025-01-09 20:32:23,038 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2042 transitions. Word has length 153 [2025-01-09 20:32:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:23,039 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2042 transitions. [2025-01-09 20:32:23,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2042 transitions. [2025-01-09 20:32:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 20:32:23,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:23,041 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:23,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:32:23,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:23,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2072573779, now seen corresponding path program 1 times [2025-01-09 20:32:23,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745476833] [2025-01-09 20:32:23,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:24,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 20:32:24,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 20:32:24,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:24,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 20:32:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745476833] [2025-01-09 20:32:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745476833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:32:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872766840] [2025-01-09 20:32:24,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:24,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:32:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:32:24,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:32:24,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:32:26,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 20:32:26,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 20:32:26,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:26,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:26,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 20:32:26,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:32:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:26,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:32:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872766840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:32:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 20:32:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780227116] [2025-01-09 20:32:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:26,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:26,769 INFO L87 Difference]: Start difference. First operand 1585 states and 2042 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:26,921 INFO L93 Difference]: Finished difference Result 2981 states and 3807 transitions. [2025-01-09 20:32:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2025-01-09 20:32:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:26,963 INFO L225 Difference]: With dead ends: 2981 [2025-01-09 20:32:26,963 INFO L226 Difference]: Without dead ends: 1637 [2025-01-09 20:32:26,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:26,967 INFO L435 NwaCegarLoop]: 1883 mSDtfsCounter, 1801 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:26,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 1950 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-01-09 20:32:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1634. [2025-01-09 20:32:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1033 states have (on average 1.1829622458857696) internal successors, (1222), 1075 states have internal predecessors, (1222), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2102 transitions. [2025-01-09 20:32:27,098 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2102 transitions. Word has length 161 [2025-01-09 20:32:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:27,101 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2102 transitions. [2025-01-09 20:32:27,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2102 transitions. [2025-01-09 20:32:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:32:27,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:27,103 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:27,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:32:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:32:27,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash 866765340, now seen corresponding path program 1 times [2025-01-09 20:32:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532709447] [2025-01-09 20:32:27,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:28,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:32:28,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:32:28,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:28,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:30,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532709447] [2025-01-09 20:32:30,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532709447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:30,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:32:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137981551] [2025-01-09 20:32:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:30,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:32:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:30,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:32:30,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:32:30,257 INFO L87 Difference]: Start difference. First operand 1634 states and 2102 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:34,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:32:40,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:40,084 INFO L93 Difference]: Finished difference Result 3158 states and 4075 transitions. [2025-01-09 20:32:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:32:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2025-01-09 20:32:40,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:40,092 INFO L225 Difference]: With dead ends: 3158 [2025-01-09 20:32:40,092 INFO L226 Difference]: Without dead ends: 1634 [2025-01-09 20:32:40,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:32:40,096 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 1775 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 6470 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:40,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 6470 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 797 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2025-01-09 20:32:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-01-09 20:32:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-01-09 20:32:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1033 states have (on average 1.181026137463698) internal successors, (1220), 1075 states have internal predecessors, (1220), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2100 transitions. [2025-01-09 20:32:40,185 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2100 transitions. Word has length 166 [2025-01-09 20:32:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:40,185 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2100 transitions. [2025-01-09 20:32:40,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2100 transitions. [2025-01-09 20:32:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 20:32:40,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:40,187 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:40,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:32:40,187 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash 866824922, now seen corresponding path program 1 times [2025-01-09 20:32:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572137641] [2025-01-09 20:32:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 20:32:41,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 20:32:41,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572137641] [2025-01-09 20:32:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572137641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:41,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197481619] [2025-01-09 20:32:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:41,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:41,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:41,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:41,586 INFO L87 Difference]: Start difference. First operand 1634 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:32:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:41,772 INFO L93 Difference]: Finished difference Result 1634 states and 2100 transitions. [2025-01-09 20:32:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2025-01-09 20:32:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:41,784 INFO L225 Difference]: With dead ends: 1634 [2025-01-09 20:32:41,784 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 20:32:41,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:41,785 INFO L435 NwaCegarLoop]: 1814 mSDtfsCounter, 0 mSDsluCounter, 3625 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5439 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:41,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5439 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 20:32:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2025-01-09 20:32:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1032 states have (on average 1.179263565891473) internal successors, (1217), 1073 states have internal predecessors, (1217), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2097 transitions. [2025-01-09 20:32:41,962 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2097 transitions. Word has length 166 [2025-01-09 20:32:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2097 transitions. [2025-01-09 20:32:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:32:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2097 transitions. [2025-01-09 20:32:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 20:32:41,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:41,964 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:32:41,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash 556466230, now seen corresponding path program 1 times [2025-01-09 20:32:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246779759] [2025-01-09 20:32:41,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 20:32:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 20:32:42,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:42,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246779759] [2025-01-09 20:32:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246779759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183232396] [2025-01-09 20:32:43,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:43,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:43,119 INFO L87 Difference]: Start difference. First operand 1632 states and 2097 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:43,329 INFO L93 Difference]: Finished difference Result 1632 states and 2097 transitions. [2025-01-09 20:32:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-01-09 20:32:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:43,336 INFO L225 Difference]: With dead ends: 1632 [2025-01-09 20:32:43,336 INFO L226 Difference]: Without dead ends: 1630 [2025-01-09 20:32:43,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:43,337 INFO L435 NwaCegarLoop]: 1812 mSDtfsCounter, 1773 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:43,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 3623 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-01-09 20:32:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-01-09 20:32:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1031 states have (on average 1.1784675072744908) internal successors, (1215), 1071 states have internal predecessors, (1215), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2095 transitions. [2025-01-09 20:32:43,428 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2095 transitions. Word has length 127 [2025-01-09 20:32:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:43,429 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2095 transitions. [2025-01-09 20:32:43,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2095 transitions. [2025-01-09 20:32:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 20:32:43,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:43,431 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:43,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:32:43,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:43,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash 784438700, now seen corresponding path program 1 times [2025-01-09 20:32:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500805744] [2025-01-09 20:32:43,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:44,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 20:32:44,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 20:32:44,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 20:32:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500805744] [2025-01-09 20:32:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500805744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:32:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220296319] [2025-01-09 20:32:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:44,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:44,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:44,388 INFO L87 Difference]: Start difference. First operand 1630 states and 2095 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:44,474 INFO L93 Difference]: Finished difference Result 3144 states and 4054 transitions. [2025-01-09 20:32:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2025-01-09 20:32:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:44,481 INFO L225 Difference]: With dead ends: 3144 [2025-01-09 20:32:44,481 INFO L226 Difference]: Without dead ends: 1624 [2025-01-09 20:32:44,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:44,484 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 1766 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:44,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 1808 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2025-01-09 20:32:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2025-01-09 20:32:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1026 states have (on average 1.1754385964912282) internal successors, (1206), 1065 states have internal predecessors, (1206), 441 states have call successors, (441), 143 states have call predecessors, (441), 142 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2086 transitions. [2025-01-09 20:32:44,575 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2086 transitions. Word has length 173 [2025-01-09 20:32:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:44,575 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2086 transitions. [2025-01-09 20:32:44,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2086 transitions. [2025-01-09 20:32:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:32:44,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:44,577 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:44,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:32:44,578 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:44,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:44,579 INFO L85 PathProgramCache]: Analyzing trace with hash -85732123, now seen corresponding path program 1 times [2025-01-09 20:32:44,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:44,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477778025] [2025-01-09 20:32:44,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:44,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:45,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:32:45,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:32:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2025-01-09 20:32:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477778025] [2025-01-09 20:32:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477778025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834099518] [2025-01-09 20:32:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:46,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:46,233 INFO L87 Difference]: Start difference. First operand 1624 states and 2086 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:46,512 INFO L93 Difference]: Finished difference Result 1652 states and 2110 transitions. [2025-01-09 20:32:46,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2025-01-09 20:32:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:46,521 INFO L225 Difference]: With dead ends: 1652 [2025-01-09 20:32:46,521 INFO L226 Difference]: Without dead ends: 1650 [2025-01-09 20:32:46,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:46,523 INFO L435 NwaCegarLoop]: 1810 mSDtfsCounter, 1720 mSDsluCounter, 3664 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:46,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 5474 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:32:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-01-09 20:32:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1648. [2025-01-09 20:32:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1044 states have (on average 1.1743295019157087) internal successors, (1226), 1083 states have internal predecessors, (1226), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2106 transitions. [2025-01-09 20:32:46,687 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2106 transitions. Word has length 164 [2025-01-09 20:32:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2106 transitions. [2025-01-09 20:32:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2106 transitions. [2025-01-09 20:32:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 20:32:46,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:46,689 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:32:46,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -542410559, now seen corresponding path program 1 times [2025-01-09 20:32:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319150033] [2025-01-09 20:32:46,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 20:32:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 20:32:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319150033] [2025-01-09 20:32:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319150033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249836035] [2025-01-09 20:32:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:47,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:47,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:47,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:47,849 INFO L87 Difference]: Start difference. First operand 1648 states and 2106 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:48,105 INFO L93 Difference]: Finished difference Result 1648 states and 2106 transitions. [2025-01-09 20:32:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-01-09 20:32:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:48,122 INFO L225 Difference]: With dead ends: 1648 [2025-01-09 20:32:48,122 INFO L226 Difference]: Without dead ends: 1646 [2025-01-09 20:32:48,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:48,123 INFO L435 NwaCegarLoop]: 1805 mSDtfsCounter, 1765 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:48,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 3609 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-01-09 20:32:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2025-01-09 20:32:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1043 states have (on average 1.1735378715244487) internal successors, (1224), 1081 states have internal predecessors, (1224), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2104 transitions. [2025-01-09 20:32:48,239 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2104 transitions. Word has length 133 [2025-01-09 20:32:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2104 transitions. [2025-01-09 20:32:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2104 transitions. [2025-01-09 20:32:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 20:32:48,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:48,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:48,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:32:48,243 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1889598168, now seen corresponding path program 1 times [2025-01-09 20:32:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860684251] [2025-01-09 20:32:48,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:49,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 20:32:49,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 20:32:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860684251] [2025-01-09 20:32:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860684251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:49,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:49,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150357796] [2025-01-09 20:32:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:49,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:49,320 INFO L87 Difference]: Start difference. First operand 1646 states and 2104 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:49,507 INFO L93 Difference]: Finished difference Result 1646 states and 2104 transitions. [2025-01-09 20:32:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-01-09 20:32:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:49,513 INFO L225 Difference]: With dead ends: 1646 [2025-01-09 20:32:49,514 INFO L226 Difference]: Without dead ends: 1644 [2025-01-09 20:32:49,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:49,516 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1762 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 3605 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:49,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 3605 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-01-09 20:32:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2025-01-09 20:32:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1042 states have (on average 1.1727447216890594) internal successors, (1222), 1079 states have internal predecessors, (1222), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2102 transitions. [2025-01-09 20:32:49,655 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2102 transitions. Word has length 139 [2025-01-09 20:32:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:49,655 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2102 transitions. [2025-01-09 20:32:49,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2102 transitions. [2025-01-09 20:32:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 20:32:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:49,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:32:49,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1051570233, now seen corresponding path program 1 times [2025-01-09 20:32:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963755907] [2025-01-09 20:32:49,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:50,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 20:32:50,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 20:32:50,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:50,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963755907] [2025-01-09 20:32:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963755907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690325942] [2025-01-09 20:32:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:50,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:50,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:50,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:50,814 INFO L87 Difference]: Start difference. First operand 1644 states and 2102 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:32:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:51,095 INFO L93 Difference]: Finished difference Result 1644 states and 2102 transitions. [2025-01-09 20:32:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:51,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-01-09 20:32:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:51,106 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 20:32:51,106 INFO L226 Difference]: Without dead ends: 1642 [2025-01-09 20:32:51,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:51,108 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 1759 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:51,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 3601 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-01-09 20:32:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2025-01-09 20:32:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1041 states have (on average 1.1719500480307397) internal successors, (1220), 1077 states have internal predecessors, (1220), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2100 transitions. [2025-01-09 20:32:51,304 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2100 transitions. Word has length 145 [2025-01-09 20:32:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:51,304 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2100 transitions. [2025-01-09 20:32:51,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:32:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2100 transitions. [2025-01-09 20:32:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 20:32:51,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:51,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:51,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:32:51,306 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:51,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2141868155, now seen corresponding path program 1 times [2025-01-09 20:32:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324677118] [2025-01-09 20:32:51,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:51,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:52,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 20:32:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 20:32:52,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324677118] [2025-01-09 20:32:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324677118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319948230] [2025-01-09 20:32:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:52,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:52,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:52,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:52,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:52,546 INFO L87 Difference]: Start difference. First operand 1642 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:32:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:52,735 INFO L93 Difference]: Finished difference Result 1642 states and 2100 transitions. [2025-01-09 20:32:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-01-09 20:32:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:52,744 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 20:32:52,744 INFO L226 Difference]: Without dead ends: 1640 [2025-01-09 20:32:52,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:52,746 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 1756 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:52,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 3597 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-01-09 20:32:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2025-01-09 20:32:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1040 states have (on average 1.1711538461538462) internal successors, (1218), 1075 states have internal predecessors, (1218), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2098 transitions. [2025-01-09 20:32:52,860 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2098 transitions. Word has length 151 [2025-01-09 20:32:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:52,860 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2098 transitions. [2025-01-09 20:32:52,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:32:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2098 transitions. [2025-01-09 20:32:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 20:32:52,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:52,863 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:52,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:32:52,863 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1482224822, now seen corresponding path program 1 times [2025-01-09 20:32:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214055345] [2025-01-09 20:32:52,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 20:32:53,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 20:32:53,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:53,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-09 20:32:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214055345] [2025-01-09 20:32:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214055345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:54,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961978446] [2025-01-09 20:32:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:54,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:54,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:54,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:54,062 INFO L87 Difference]: Start difference. First operand 1640 states and 2098 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:32:58,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:32:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:58,482 INFO L93 Difference]: Finished difference Result 1642 states and 2099 transitions. [2025-01-09 20:32:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2025-01-09 20:32:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:58,492 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 20:32:58,492 INFO L226 Difference]: Without dead ends: 1640 [2025-01-09 20:32:58,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:58,493 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 43 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7148 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:58,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7148 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 20:32:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-01-09 20:32:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2025-01-09 20:32:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1040 states have (on average 1.1692307692307693) internal successors, (1216), 1075 states have internal predecessors, (1216), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:32:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2096 transitions. [2025-01-09 20:32:58,672 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2096 transitions. Word has length 187 [2025-01-09 20:32:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:58,676 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2096 transitions. [2025-01-09 20:32:58,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:32:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2096 transitions. [2025-01-09 20:32:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 20:32:58,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:58,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 20:32:58,682 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:32:58,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:58,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1101711215, now seen corresponding path program 1 times [2025-01-09 20:32:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:58,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558995504] [2025-01-09 20:32:58,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:59,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 20:32:59,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 20:32:59,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:59,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:32:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558995504] [2025-01-09 20:32:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558995504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071770528] [2025-01-09 20:32:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:59,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:59,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:59,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:59,866 INFO L87 Difference]: Start difference. First operand 1640 states and 2096 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:00,016 INFO L93 Difference]: Finished difference Result 1640 states and 2096 transitions. [2025-01-09 20:33:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-01-09 20:33:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:00,022 INFO L225 Difference]: With dead ends: 1640 [2025-01-09 20:33:00,022 INFO L226 Difference]: Without dead ends: 1638 [2025-01-09 20:33:00,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:00,023 INFO L435 NwaCegarLoop]: 1797 mSDtfsCounter, 1753 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:00,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 3593 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-01-09 20:33:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2025-01-09 20:33:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1039 states have (on average 1.1684311838306063) internal successors, (1214), 1073 states have internal predecessors, (1214), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:33:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2094 transitions. [2025-01-09 20:33:00,139 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2094 transitions. Word has length 157 [2025-01-09 20:33:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2094 transitions. [2025-01-09 20:33:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2094 transitions. [2025-01-09 20:33:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 20:33:00,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:00,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:00,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 20:33:00,142 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -353922304, now seen corresponding path program 1 times [2025-01-09 20:33:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120681430] [2025-01-09 20:33:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 20:33:00,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 20:33:00,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:00,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:01,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:01,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120681430] [2025-01-09 20:33:01,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120681430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510215016] [2025-01-09 20:33:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:01,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:01,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:01,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:01,219 INFO L87 Difference]: Start difference. First operand 1638 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:01,377 INFO L93 Difference]: Finished difference Result 1638 states and 2094 transitions. [2025-01-09 20:33:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-01-09 20:33:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:01,383 INFO L225 Difference]: With dead ends: 1638 [2025-01-09 20:33:01,383 INFO L226 Difference]: Without dead ends: 1636 [2025-01-09 20:33:01,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:01,384 INFO L435 NwaCegarLoop]: 1795 mSDtfsCounter, 1750 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 3589 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:01,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 3589 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-01-09 20:33:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2025-01-09 20:33:01,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1038 states have (on average 1.1676300578034682) internal successors, (1212), 1071 states have internal predecessors, (1212), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:33:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2092 transitions. [2025-01-09 20:33:01,502 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2092 transitions. Word has length 163 [2025-01-09 20:33:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:01,502 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2092 transitions. [2025-01-09 20:33:01,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2092 transitions. [2025-01-09 20:33:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 20:33:01,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:01,504 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 20:33:01,504 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:01,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1642743421, now seen corresponding path program 1 times [2025-01-09 20:33:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:01,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465723783] [2025-01-09 20:33:01,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:02,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 20:33:02,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 20:33:02,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:02,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465723783] [2025-01-09 20:33:02,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465723783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:02,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:02,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197710023] [2025-01-09 20:33:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:02,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:02,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:02,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:02,509 INFO L87 Difference]: Start difference. First operand 1636 states and 2092 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:02,671 INFO L93 Difference]: Finished difference Result 1636 states and 2092 transitions. [2025-01-09 20:33:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-01-09 20:33:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:02,676 INFO L225 Difference]: With dead ends: 1636 [2025-01-09 20:33:02,676 INFO L226 Difference]: Without dead ends: 1634 [2025-01-09 20:33:02,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:02,677 INFO L435 NwaCegarLoop]: 1793 mSDtfsCounter, 1747 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:02,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 3585 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-01-09 20:33:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-01-09 20:33:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1037 states have (on average 1.166827386692382) internal successors, (1210), 1069 states have internal predecessors, (1210), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:33:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2090 transitions. [2025-01-09 20:33:02,799 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2090 transitions. Word has length 169 [2025-01-09 20:33:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2090 transitions. [2025-01-09 20:33:02,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2090 transitions. [2025-01-09 20:33:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 20:33:02,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:02,802 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:02,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 20:33:02,802 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1951163364, now seen corresponding path program 1 times [2025-01-09 20:33:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927286692] [2025-01-09 20:33:02,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:03,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 20:33:03,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 20:33:03,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:03,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 20:33:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927286692] [2025-01-09 20:33:03,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927286692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:03,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:03,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237569732] [2025-01-09 20:33:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:03,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:03,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:03,885 INFO L87 Difference]: Start difference. First operand 1634 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:33:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:04,178 INFO L93 Difference]: Finished difference Result 1634 states and 2090 transitions. [2025-01-09 20:33:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:04,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 20:33:04,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:04,185 INFO L225 Difference]: With dead ends: 1634 [2025-01-09 20:33:04,185 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 20:33:04,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:04,186 INFO L435 NwaCegarLoop]: 1791 mSDtfsCounter, 1744 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:04,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 3581 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 20:33:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2025-01-09 20:33:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1036 states have (on average 1.166023166023166) internal successors, (1208), 1067 states have internal predecessors, (1208), 441 states have call successors, (441), 149 states have call predecessors, (441), 148 states have return successors, (439), 434 states have call predecessors, (439), 439 states have call successors, (439) [2025-01-09 20:33:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2088 transitions. [2025-01-09 20:33:04,404 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2088 transitions. Word has length 175 [2025-01-09 20:33:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:04,405 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2088 transitions. [2025-01-09 20:33:04,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:33:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2088 transitions. [2025-01-09 20:33:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 20:33:04,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:04,408 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:04,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 20:33:04,408 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-01-09 20:33:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1665932543, now seen corresponding path program 1 times [2025-01-09 20:33:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051631928] [2025-01-09 20:33:04,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:05,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 20:33:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 20:33:05,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:05,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat