./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--memstick--core--ms_block.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--memstick--core--ms_block.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 66bac413628aea28df41e5815c9797e59bd0b92879c97b090502234c31960876 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:28:51,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:28:51,694 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:28:51,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:28:51,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:28:51,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:28:51,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:28:51,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:28:51,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:28:51,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:28:51,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:28:51,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:28:51,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:28:51,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:28:51,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:51,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:51,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:28:51,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:28:51,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:28:51,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:28:51,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:28:51,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:28:51,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:28:51,724 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 -> 66bac413628aea28df41e5815c9797e59bd0b92879c97b090502234c31960876 [2025-01-09 20:28:51,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:28:51,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:28:51,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:28:51,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:28:51,986 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:28:51,987 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--memstick--core--ms_block.ko.cil.i [2025-01-09 20:28:53,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa5c1bf7/ebfb589be5c449729d8e33fee99bd545/FLAG9dc3ed204 [2025-01-09 20:28:53,767 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:28:53,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--memstick--core--ms_block.ko.cil.i [2025-01-09 20:28:53,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa5c1bf7/ebfb589be5c449729d8e33fee99bd545/FLAG9dc3ed204 [2025-01-09 20:28:53,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa5c1bf7/ebfb589be5c449729d8e33fee99bd545 [2025-01-09 20:28:53,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:28:53,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:28:53,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:28:53,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:28:53,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:28:53,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:53" (1/1) ... [2025-01-09 20:28:53,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7723bce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:53, skipping insertion in model container [2025-01-09 20:28:53,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:28:53" (1/1) ... [2025-01-09 20:28:53,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:28:56,760 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--memstick--core--ms_block.ko.cil.i[345749,345762] [2025-01-09 20:28:56,762 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--memstick--core--ms_block.ko.cil.i[345894,345907] [2025-01-09 20:28:56,763 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--memstick--core--ms_block.ko.cil.i[346040,346053] [2025-01-09 20:28:56,763 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--memstick--core--ms_block.ko.cil.i[346205,346218] [2025-01-09 20:28:56,763 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--memstick--core--ms_block.ko.cil.i[346363,346376] [2025-01-09 20:28:56,764 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--memstick--core--ms_block.ko.cil.i[346521,346534] [2025-01-09 20:28:56,764 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--memstick--core--ms_block.ko.cil.i[346679,346692] [2025-01-09 20:28:56,764 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--memstick--core--ms_block.ko.cil.i[346839,346852] [2025-01-09 20:28:56,764 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--memstick--core--ms_block.ko.cil.i[346998,347011] [2025-01-09 20:28:56,765 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--memstick--core--ms_block.ko.cil.i[347137,347150] [2025-01-09 20:28:56,765 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--memstick--core--ms_block.ko.cil.i[347279,347292] [2025-01-09 20:28:56,765 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--memstick--core--ms_block.ko.cil.i[347428,347441] [2025-01-09 20:28:56,765 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--memstick--core--ms_block.ko.cil.i[347567,347580] [2025-01-09 20:28:56,765 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--memstick--core--ms_block.ko.cil.i[347722,347735] [2025-01-09 20:28:56,766 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--memstick--core--ms_block.ko.cil.i[347882,347895] [2025-01-09 20:28:56,766 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--memstick--core--ms_block.ko.cil.i[348033,348046] [2025-01-09 20:28:56,766 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--memstick--core--ms_block.ko.cil.i[348184,348197] [2025-01-09 20:28:56,766 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--memstick--core--ms_block.ko.cil.i[348336,348349] [2025-01-09 20:28:56,767 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--memstick--core--ms_block.ko.cil.i[348485,348498] [2025-01-09 20:28:56,767 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--memstick--core--ms_block.ko.cil.i[348633,348646] [2025-01-09 20:28:56,767 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--memstick--core--ms_block.ko.cil.i[348790,348803] [2025-01-09 20:28:56,767 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--memstick--core--ms_block.ko.cil.i[348939,348952] [2025-01-09 20:28:56,767 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--memstick--core--ms_block.ko.cil.i[349095,349108] [2025-01-09 20:28:56,768 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--memstick--core--ms_block.ko.cil.i[349248,349261] [2025-01-09 20:28:56,768 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--memstick--core--ms_block.ko.cil.i[349394,349407] [2025-01-09 20:28:56,768 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--memstick--core--ms_block.ko.cil.i[349537,349550] [2025-01-09 20:28:56,768 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--memstick--core--ms_block.ko.cil.i[349689,349702] [2025-01-09 20:28:56,769 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--memstick--core--ms_block.ko.cil.i[349835,349848] [2025-01-09 20:28:56,769 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--memstick--core--ms_block.ko.cil.i[349980,349993] [2025-01-09 20:28:56,769 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--memstick--core--ms_block.ko.cil.i[350134,350147] [2025-01-09 20:28:56,769 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--memstick--core--ms_block.ko.cil.i[350285,350298] [2025-01-09 20:28:56,769 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--memstick--core--ms_block.ko.cil.i[350440,350453] [2025-01-09 20:28:56,770 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--memstick--core--ms_block.ko.cil.i[350592,350605] [2025-01-09 20:28:56,770 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--memstick--core--ms_block.ko.cil.i[350747,350760] [2025-01-09 20:28:56,770 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--memstick--core--ms_block.ko.cil.i[350911,350924] [2025-01-09 20:28:56,770 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--memstick--core--ms_block.ko.cil.i[351067,351080] [2025-01-09 20:28:56,770 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--memstick--core--ms_block.ko.cil.i[351231,351244] [2025-01-09 20:28:56,771 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--memstick--core--ms_block.ko.cil.i[351373,351386] [2025-01-09 20:28:56,771 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--memstick--core--ms_block.ko.cil.i[351531,351544] [2025-01-09 20:28:56,771 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--memstick--core--ms_block.ko.cil.i[351698,351711] [2025-01-09 20:28:56,771 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--memstick--core--ms_block.ko.cil.i[351857,351870] [2025-01-09 20:28:56,771 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--memstick--core--ms_block.ko.cil.i[352016,352029] [2025-01-09 20:28:56,772 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--memstick--core--ms_block.ko.cil.i[352165,352178] [2025-01-09 20:28:56,772 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--memstick--core--ms_block.ko.cil.i[352312,352325] [2025-01-09 20:28:56,772 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--memstick--core--ms_block.ko.cil.i[352451,352464] [2025-01-09 20:28:56,772 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--memstick--core--ms_block.ko.cil.i[352614,352627] [2025-01-09 20:28:56,773 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--memstick--core--ms_block.ko.cil.i[352780,352793] [2025-01-09 20:28:56,775 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--memstick--core--ms_block.ko.cil.i[352944,352957] [2025-01-09 20:28:56,775 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--memstick--core--ms_block.ko.cil.i[353109,353122] [2025-01-09 20:28:56,776 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--memstick--core--ms_block.ko.cil.i[353274,353287] [2025-01-09 20:28:56,776 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--memstick--core--ms_block.ko.cil.i[353440,353453] [2025-01-09 20:28:56,776 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--memstick--core--ms_block.ko.cil.i[353605,353618] [2025-01-09 20:28:56,776 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--memstick--core--ms_block.ko.cil.i[353772,353785] [2025-01-09 20:28:56,777 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--memstick--core--ms_block.ko.cil.i[353932,353945] [2025-01-09 20:28:56,777 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--memstick--core--ms_block.ko.cil.i[354094,354107] [2025-01-09 20:28:56,777 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--memstick--core--ms_block.ko.cil.i[354253,354266] [2025-01-09 20:28:56,777 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--memstick--core--ms_block.ko.cil.i[354399,354412] [2025-01-09 20:28:56,778 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--memstick--core--ms_block.ko.cil.i[354542,354555] [2025-01-09 20:28:56,778 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--memstick--core--ms_block.ko.cil.i[354686,354699] [2025-01-09 20:28:56,778 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--memstick--core--ms_block.ko.cil.i[354829,354842] [2025-01-09 20:28:56,778 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--memstick--core--ms_block.ko.cil.i[354973,354986] [2025-01-09 20:28:56,779 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--memstick--core--ms_block.ko.cil.i[355114,355127] [2025-01-09 20:28:56,779 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--memstick--core--ms_block.ko.cil.i[355252,355265] [2025-01-09 20:28:56,779 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--memstick--core--ms_block.ko.cil.i[355410,355423] [2025-01-09 20:28:56,779 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--memstick--core--ms_block.ko.cil.i[355569,355582] [2025-01-09 20:28:56,779 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--memstick--core--ms_block.ko.cil.i[355725,355738] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[355874,355887] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[356026,356039] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[356177,356190] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[356326,356339] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[356478,356491] [2025-01-09 20:28:56,780 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--memstick--core--ms_block.ko.cil.i[356626,356639] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[356779,356792] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[356930,356943] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[357080,357093] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[357227,357240] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[357378,357391] [2025-01-09 20:28:56,781 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--memstick--core--ms_block.ko.cil.i[357529,357542] [2025-01-09 20:28:56,782 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--memstick--core--ms_block.ko.cil.i[357677,357690] [2025-01-09 20:28:56,782 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--memstick--core--ms_block.ko.cil.i[357843,357856] [2025-01-09 20:28:56,782 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--memstick--core--ms_block.ko.cil.i[358012,358025] [2025-01-09 20:28:56,782 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--memstick--core--ms_block.ko.cil.i[358179,358192] [2025-01-09 20:28:56,783 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--memstick--core--ms_block.ko.cil.i[358347,358360] [2025-01-09 20:28:56,783 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--memstick--core--ms_block.ko.cil.i[358497,358510] [2025-01-09 20:28:56,783 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--memstick--core--ms_block.ko.cil.i[358644,358657] [2025-01-09 20:28:56,783 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--memstick--core--ms_block.ko.cil.i[358805,358818] [2025-01-09 20:28:56,783 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--memstick--core--ms_block.ko.cil.i[358975,358988] [2025-01-09 20:28:56,784 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--memstick--core--ms_block.ko.cil.i[359137,359150] [2025-01-09 20:28:56,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:28:56,806 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:28:56,870 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"); [4563] [2025-01-09 20:28:56,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4570] [2025-01-09 20:28:56,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4577] [2025-01-09 20:28:56,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [4585-4586] [2025-01-09 20:28:56,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4666-4667] [2025-01-09 20:28:56,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4672-4674] [2025-01-09 20:28:56,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (809), "i" (12UL)); [4699-4700] [2025-01-09 20:28:56,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (45UL), [paravirt_opptr] "i" (& pv_irq_ops.restore_fl.func), [paravirt_clobber] "i" (1), "D" (f): "memory", "cc"); [4705-4707] [2025-01-09 20:28:56,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (814), "i" (12UL)); [4731-4732] [2025-01-09 20:28:56,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (46UL), [paravirt_opptr] "i" (& pv_irq_ops.irq_disable.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4737-4739] [2025-01-09 20:28:56,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [4921-4922] [2025-01-09 20:28:56,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (67), "i" (12UL)); [4932-4933] [2025-01-09 20:28:56,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (68), "i" (12UL)); [4943-4944] [2025-01-09 20:28:56,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (98), "i" (12UL)); [4975-4976] [2025-01-09 20:28:56,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (99), "i" (12UL)); [4986-4987] [2025-01-09 20:28:56,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (168), "i" (12UL)); [5004-5005] [2025-01-09 20:28:56,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (464), "i" (12UL)); [5725-5726] [2025-01-09 20:28:56,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (577), "i" (12UL)); [5894-5895] [2025-01-09 20:28:56,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (653), "i" (12UL)); [6029-6030] [2025-01-09 20:28:56,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (676), "i" (12UL)); [6086-6087] [2025-01-09 20:28:56,915 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (719), "i" (12UL)); [6166-6167] [2025-01-09 20:28:56,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (953), "i" (12UL)); [6555-6556] [2025-01-09 20:28:56,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (1004), "i" (12UL)); [6645-6646] [2025-01-09 20:28:56,938 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"drivers/memstick/core/ms_block.c"), "i" (1262), "i" (12UL)); [7113-7114] [2025-01-09 20:28:57,026 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--memstick--core--ms_block.ko.cil.i[345749,345762] [2025-01-09 20:28:57,027 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--memstick--core--ms_block.ko.cil.i[345894,345907] [2025-01-09 20:28:57,027 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--memstick--core--ms_block.ko.cil.i[346040,346053] [2025-01-09 20:28:57,027 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--memstick--core--ms_block.ko.cil.i[346205,346218] [2025-01-09 20:28:57,027 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--memstick--core--ms_block.ko.cil.i[346363,346376] [2025-01-09 20:28:57,027 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--memstick--core--ms_block.ko.cil.i[346521,346534] [2025-01-09 20:28:57,028 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--memstick--core--ms_block.ko.cil.i[346679,346692] [2025-01-09 20:28:57,028 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--memstick--core--ms_block.ko.cil.i[346839,346852] [2025-01-09 20:28:57,028 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--memstick--core--ms_block.ko.cil.i[346998,347011] [2025-01-09 20:28:57,028 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--memstick--core--ms_block.ko.cil.i[347137,347150] [2025-01-09 20:28:57,028 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--memstick--core--ms_block.ko.cil.i[347279,347292] [2025-01-09 20:28:57,029 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--memstick--core--ms_block.ko.cil.i[347428,347441] [2025-01-09 20:28:57,029 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--memstick--core--ms_block.ko.cil.i[347567,347580] [2025-01-09 20:28:57,029 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--memstick--core--ms_block.ko.cil.i[347722,347735] [2025-01-09 20:28:57,029 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--memstick--core--ms_block.ko.cil.i[347882,347895] [2025-01-09 20:28:57,030 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--memstick--core--ms_block.ko.cil.i[348033,348046] [2025-01-09 20:28:57,030 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--memstick--core--ms_block.ko.cil.i[348184,348197] [2025-01-09 20:28:57,030 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--memstick--core--ms_block.ko.cil.i[348336,348349] [2025-01-09 20:28:57,030 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--memstick--core--ms_block.ko.cil.i[348485,348498] [2025-01-09 20:28:57,030 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--memstick--core--ms_block.ko.cil.i[348633,348646] [2025-01-09 20:28:57,031 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--memstick--core--ms_block.ko.cil.i[348790,348803] [2025-01-09 20:28:57,031 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--memstick--core--ms_block.ko.cil.i[348939,348952] [2025-01-09 20:28:57,031 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--memstick--core--ms_block.ko.cil.i[349095,349108] [2025-01-09 20:28:57,031 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--memstick--core--ms_block.ko.cil.i[349248,349261] [2025-01-09 20:28:57,031 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--memstick--core--ms_block.ko.cil.i[349394,349407] [2025-01-09 20:28:57,032 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--memstick--core--ms_block.ko.cil.i[349537,349550] [2025-01-09 20:28:57,032 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--memstick--core--ms_block.ko.cil.i[349689,349702] [2025-01-09 20:28:57,032 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--memstick--core--ms_block.ko.cil.i[349835,349848] [2025-01-09 20:28:57,032 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--memstick--core--ms_block.ko.cil.i[349980,349993] [2025-01-09 20:28:57,033 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--memstick--core--ms_block.ko.cil.i[350134,350147] [2025-01-09 20:28:57,033 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--memstick--core--ms_block.ko.cil.i[350285,350298] [2025-01-09 20:28:57,033 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--memstick--core--ms_block.ko.cil.i[350440,350453] [2025-01-09 20:28:57,033 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--memstick--core--ms_block.ko.cil.i[350592,350605] [2025-01-09 20:28:57,034 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--memstick--core--ms_block.ko.cil.i[350747,350760] [2025-01-09 20:28:57,034 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--memstick--core--ms_block.ko.cil.i[350911,350924] [2025-01-09 20:28:57,034 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--memstick--core--ms_block.ko.cil.i[351067,351080] [2025-01-09 20:28:57,034 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--memstick--core--ms_block.ko.cil.i[351231,351244] [2025-01-09 20:28:57,034 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--memstick--core--ms_block.ko.cil.i[351373,351386] [2025-01-09 20:28:57,035 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--memstick--core--ms_block.ko.cil.i[351531,351544] [2025-01-09 20:28:57,035 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--memstick--core--ms_block.ko.cil.i[351698,351711] [2025-01-09 20:28:57,035 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--memstick--core--ms_block.ko.cil.i[351857,351870] [2025-01-09 20:28:57,035 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--memstick--core--ms_block.ko.cil.i[352016,352029] [2025-01-09 20:28:57,035 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--memstick--core--ms_block.ko.cil.i[352165,352178] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[352312,352325] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[352451,352464] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[352614,352627] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[352780,352793] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[352944,352957] [2025-01-09 20:28:57,036 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--memstick--core--ms_block.ko.cil.i[353109,353122] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[353274,353287] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[353440,353453] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[353605,353618] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[353772,353785] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[353932,353945] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[354094,354107] [2025-01-09 20:28:57,037 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--memstick--core--ms_block.ko.cil.i[354253,354266] [2025-01-09 20:28:57,038 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--memstick--core--ms_block.ko.cil.i[354399,354412] [2025-01-09 20:28:57,038 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--memstick--core--ms_block.ko.cil.i[354542,354555] [2025-01-09 20:28:57,038 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--memstick--core--ms_block.ko.cil.i[354686,354699] [2025-01-09 20:28:57,038 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--memstick--core--ms_block.ko.cil.i[354829,354842] [2025-01-09 20:28:57,038 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--memstick--core--ms_block.ko.cil.i[354973,354986] [2025-01-09 20:28:57,039 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--memstick--core--ms_block.ko.cil.i[355114,355127] [2025-01-09 20:28:57,039 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--memstick--core--ms_block.ko.cil.i[355252,355265] [2025-01-09 20:28:57,039 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--memstick--core--ms_block.ko.cil.i[355410,355423] [2025-01-09 20:28:57,039 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--memstick--core--ms_block.ko.cil.i[355569,355582] [2025-01-09 20:28:57,040 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--memstick--core--ms_block.ko.cil.i[355725,355738] [2025-01-09 20:28:57,040 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--memstick--core--ms_block.ko.cil.i[355874,355887] [2025-01-09 20:28:57,040 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--memstick--core--ms_block.ko.cil.i[356026,356039] [2025-01-09 20:28:57,040 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--memstick--core--ms_block.ko.cil.i[356177,356190] [2025-01-09 20:28:57,040 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--memstick--core--ms_block.ko.cil.i[356326,356339] [2025-01-09 20:28:57,041 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--memstick--core--ms_block.ko.cil.i[356478,356491] [2025-01-09 20:28:57,041 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--memstick--core--ms_block.ko.cil.i[356626,356639] [2025-01-09 20:28:57,041 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--memstick--core--ms_block.ko.cil.i[356779,356792] [2025-01-09 20:28:57,041 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--memstick--core--ms_block.ko.cil.i[356930,356943] [2025-01-09 20:28:57,041 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--memstick--core--ms_block.ko.cil.i[357080,357093] [2025-01-09 20:28:57,042 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--memstick--core--ms_block.ko.cil.i[357227,357240] [2025-01-09 20:28:57,042 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--memstick--core--ms_block.ko.cil.i[357378,357391] [2025-01-09 20:28:57,042 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--memstick--core--ms_block.ko.cil.i[357529,357542] [2025-01-09 20:28:57,042 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--memstick--core--ms_block.ko.cil.i[357677,357690] [2025-01-09 20:28:57,042 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--memstick--core--ms_block.ko.cil.i[357843,357856] [2025-01-09 20:28:57,043 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--memstick--core--ms_block.ko.cil.i[358012,358025] [2025-01-09 20:28:57,043 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--memstick--core--ms_block.ko.cil.i[358179,358192] [2025-01-09 20:28:57,043 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--memstick--core--ms_block.ko.cil.i[358347,358360] [2025-01-09 20:28:57,043 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--memstick--core--ms_block.ko.cil.i[358497,358510] [2025-01-09 20:28:57,043 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--memstick--core--ms_block.ko.cil.i[358644,358657] [2025-01-09 20:28:57,044 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--memstick--core--ms_block.ko.cil.i[358805,358818] [2025-01-09 20:28:57,044 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--memstick--core--ms_block.ko.cil.i[358975,358988] [2025-01-09 20:28:57,044 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--memstick--core--ms_block.ko.cil.i[359137,359150] [2025-01-09 20:28:57,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:28:57,151 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:28:57,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57 WrapperNode [2025-01-09 20:28:57,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:28:57,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:28:57,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:28:57,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:28:57,157 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:28:57" (1/1) ... [2025-01-09 20:28:57,204 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:28:57" (1/1) ... [2025-01-09 20:28:57,315 INFO L138 Inliner]: procedures = 604, calls = 2265, calls flagged for inlining = 266, calls inlined = 158, statements flattened = 3338 [2025-01-09 20:28:57,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:28:57,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:28:57,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:28:57,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:28:57,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,670 INFO L175 MemorySlicer]: Split 515 memory accesses to 15 slices as follows [23, 2, 5, 7, 1, 3, 1, 2, 4, 412, 1, 2, 34, 16, 2]. 80 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 16, 0]. The 252 writes are split as follows [23, 1, 4, 4, 0, 0, 1, 1, 0, 189, 0, 0, 29, 0, 0]. [2025-01-09 20:28:57,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:28:57,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:28:57,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:28:57,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:28:57,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (1/1) ... [2025-01-09 20:28:57,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:28:57,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:28:57,873 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:28:57,879 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:28:57,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:28:57,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:28:57,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 20:28:57,895 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure msb_stop [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_stop [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_pba [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_pba [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_msb_disk_lock [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_msb_disk_lock [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:28:57,896 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-01-09 20:28:57,896 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-01-09 20:28:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:28:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:28:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:28:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:28:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_idr_remove_msb_disk_idr [2025-01-09 20:28:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_idr_remove_msb_disk_idr [2025-01-09 20:28:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 20:28:57,897 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_table [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_table [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_get_drvdata [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_get_drvdata [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer_sync [2025-01-09 20:28:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer_sync [2025-01-09 20:28:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure msb_data_clear [2025-01-09 20:28:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_data_clear [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 20:28:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_bad_block_table [2025-01-09 20:28:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_bad_block_table [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:28:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-09 20:28:57,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:28:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:28:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:28:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:28:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:28:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:28:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:28:57,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_lba [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_lba [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_reset [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_reset [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_remove [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_remove [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_bad [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_bad [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_lib_idr__destroyed_before_usage [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_lib_idr__destroyed_before_usage [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_lib_idr__not_initialized [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_lib_idr__not_initialized [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:28:57,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:28:57,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_page [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_page [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_msb_data [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_msb_data [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_block_used [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_block_used [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_discard [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_discard [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_start [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_start [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:28:57,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_init_card [2025-01-09 20:28:57,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_init_card [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_one [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_one [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure msb_switch_to_parallel [2025-01-09 20:28:57,905 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_switch_to_parallel [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 20:28:57,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure msb_validate_used_block_bitmap [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_validate_used_block_bitmap [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-01-09 20:28:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-01-09 20:28:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_set_drvdata [2025-01-09 20:28:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_set_drvdata [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:28:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure msb_invalidate_reg_window [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_invalidate_reg_window [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_101 [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_101 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure msb_erase_block [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_erase_block [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_next [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_next [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_start [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_start [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure msb_run_state_machine [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_run_state_machine [2025-01-09 20:28:57,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:28:57,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:28:57,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:28:57,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:28:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:28:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:28:57,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:28:57,910 INFO L130 BoogieDeclarations]: Found specification of procedure sg_nents [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_nents [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_msb_disk_lock [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_msb_disk_lock [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_stop [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_stop [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure msb_set_overwrite_flag [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_set_overwrite_flag [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure msb_disk_release [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_disk_release [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_memstick_host [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_memstick_host [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_put_disk [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_put_disk [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:28:57,911 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2025-01-09 20:28:57,911 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2025-01-09 20:28:58,375 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:28:58,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:28:58,409 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:29:05,791 INFO L? ?]: Removed 1402 outVars from TransFormulas that were not future-live. [2025-01-09 20:29:05,792 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:29:05,840 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:29:05,841 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 20:29:05,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:05 BoogieIcfgContainer [2025-01-09 20:29:05,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:29:05,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:29:05,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:29:05,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:29:05,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:28:53" (1/3) ... [2025-01-09 20:29:05,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7de01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:05, skipping insertion in model container [2025-01-09 20:29:05,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:28:57" (2/3) ... [2025-01-09 20:29:05,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7de01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:29:05, skipping insertion in model container [2025-01-09 20:29:05,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:29:05" (3/3) ... [2025-01-09 20:29:05,850 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--memstick--core--ms_block.ko.cil.i [2025-01-09 20:29:05,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:29:05,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--memstick--core--ms_block.ko.cil.i that has 115 procedures, 1552 locations, 1 initial locations, 16 loop locations, and 36 error locations. [2025-01-09 20:29:05,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:29:05,947 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;@5f0a6d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:29:05,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-09 20:29:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 1507 states, 994 states have (on average 1.2987927565392354) internal successors, (1291), 1049 states have internal predecessors, (1291), 374 states have call successors, (374), 103 states have call predecessors, (374), 102 states have return successors, (371), 368 states have call predecessors, (371), 371 states have call successors, (371) [2025-01-09 20:29:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 20:29:05,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:05,960 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:05,960 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 34 more)] === [2025-01-09 20:29:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -464929466, now seen corresponding path program 1 times [2025-01-09 20:29:05,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:05,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289261238] [2025-01-09 20:29:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:06,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 20:29:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 20:29:06,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289261238] [2025-01-09 20:29:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289261238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:07,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245321148] [2025-01-09 20:29:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:07,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:07,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:07,696 INFO L87 Difference]: Start difference. First operand has 1507 states, 994 states have (on average 1.2987927565392354) internal successors, (1291), 1049 states have internal predecessors, (1291), 374 states have call successors, (374), 103 states have call predecessors, (374), 102 states have return successors, (371), 368 states have call predecessors, (371), 371 states have call successors, (371) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 20:29:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:07,995 INFO L93 Difference]: Finished difference Result 2967 states and 4139 transitions. [2025-01-09 20:29:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2025-01-09 20:29:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:08,024 INFO L225 Difference]: With dead ends: 2967 [2025-01-09 20:29:08,025 INFO L226 Difference]: Without dead ends: 1491 [2025-01-09 20:29:08,036 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:29:08,038 INFO L435 NwaCegarLoop]: 1986 mSDtfsCounter, 1964 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 3971 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:29:08,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 3971 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-01-09 20:29:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2025-01-09 20:29:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 984 states have (on average 1.2540650406504066) internal successors, (1234), 1036 states have internal predecessors, (1234), 371 states have call successors, (371), 102 states have call predecessors, (371), 101 states have return successors, (369), 366 states have call predecessors, (369), 369 states have call successors, (369) [2025-01-09 20:29:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1974 transitions. [2025-01-09 20:29:08,176 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1974 transitions. Word has length 56 [2025-01-09 20:29:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:08,179 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 1974 transitions. [2025-01-09 20:29:08,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 20:29:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1974 transitions. [2025-01-09 20:29:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 20:29:08,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:08,183 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:08,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:29:08,183 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 34 more)] === [2025-01-09 20:29:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:08,188 INFO L85 PathProgramCache]: Analyzing trace with hash -213951136, now seen corresponding path program 1 times [2025-01-09 20:29:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335694846] [2025-01-09 20:29:08,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:08,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 20:29:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 20:29:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:08,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335694846] [2025-01-09 20:29:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335694846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:09,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065150859] [2025-01-09 20:29:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:09,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:09,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:09,340 INFO L87 Difference]: Start difference. First operand 1491 states and 1974 transitions. 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:29:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:09,654 INFO L93 Difference]: Finished difference Result 2921 states and 3871 transitions. [2025-01-09 20:29:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:09,655 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2025-01-09 20:29:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:09,675 INFO L225 Difference]: With dead ends: 2921 [2025-01-09 20:29:09,676 INFO L226 Difference]: Without dead ends: 2919 [2025-01-09 20:29:09,679 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:29:09,681 INFO L435 NwaCegarLoop]: 2074 mSDtfsCounter, 1917 mSDsluCounter, 3984 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:09,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 6058 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:29:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2025-01-09 20:29:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2720. [2025-01-09 20:29:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 1814 states have (on average 1.260749724366042) internal successors, (2287), 1885 states have internal predecessors, (2287), 687 states have call successors, (687), 185 states have call predecessors, (687), 184 states have return successors, (691), 676 states have call predecessors, (691), 685 states have call successors, (691) [2025-01-09 20:29:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3665 transitions. [2025-01-09 20:29:09,863 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3665 transitions. Word has length 62 [2025-01-09 20:29:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 3665 transitions. [2025-01-09 20:29:09,864 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:29:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3665 transitions. [2025-01-09 20:29:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 20:29:09,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:09,866 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:29:09,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_lib_idr__not_initializedErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 20:29:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 258141718, now seen corresponding path program 1 times [2025-01-09 20:29:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160868554] [2025-01-09 20:29:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:10,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 20:29:10,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 20:29:10,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:10,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 20:29:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160868554] [2025-01-09 20:29:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160868554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 20:29:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849479433] [2025-01-09 20:29:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:12,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 20:29:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:12,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 20:29:12,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:29:12,440 INFO L87 Difference]: Start difference. First operand 2720 states and 3665 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 20:29:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:14,685 INFO L93 Difference]: Finished difference Result 2922 states and 3873 transitions. [2025-01-09 20:29:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 20:29:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 65 [2025-01-09 20:29:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:14,703 INFO L225 Difference]: With dead ends: 2922 [2025-01-09 20:29:14,703 INFO L226 Difference]: Without dead ends: 2735 [2025-01-09 20:29:14,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:29:14,708 INFO L435 NwaCegarLoop]: 1947 mSDtfsCounter, 4 mSDsluCounter, 25237 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27184 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:14,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27184 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 20:29:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-01-09 20:29:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2732. [2025-01-09 20:29:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 1822 states have (on average 1.2596048298572997) internal successors, (2295), 1893 states have internal predecessors, (2295), 691 states have call successors, (691), 185 states have call predecessors, (691), 184 states have return successors, (695), 680 states have call predecessors, (695), 689 states have call successors, (695) [2025-01-09 20:29:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3681 transitions. [2025-01-09 20:29:14,869 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3681 transitions. Word has length 65 [2025-01-09 20:29:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:14,869 INFO L471 AbstractCegarLoop]: Abstraction has 2732 states and 3681 transitions. [2025-01-09 20:29:14,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-09 20:29:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3681 transitions. [2025-01-09 20:29:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:29:14,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:14,874 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:29:14,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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 34 more)] === [2025-01-09 20:29:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -372919553, now seen corresponding path program 1 times [2025-01-09 20:29:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347025608] [2025-01-09 20:29:14,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:29:15,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:29:15,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:15,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:15,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347025608] [2025-01-09 20:29:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347025608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148971794] [2025-01-09 20:29:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:15,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:15,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:15,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:15,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:15,793 INFO L87 Difference]: Start difference. First operand 2732 states and 3681 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, (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:29:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:16,056 INFO L93 Difference]: Finished difference Result 5395 states and 7268 transitions. [2025-01-09 20:29:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:16,057 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, (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 68 [2025-01-09 20:29:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:16,083 INFO L225 Difference]: With dead ends: 5395 [2025-01-09 20:29:16,083 INFO L226 Difference]: Without dead ends: 5393 [2025-01-09 20:29:16,085 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:29:16,087 INFO L435 NwaCegarLoop]: 2038 mSDtfsCounter, 1945 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 5970 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:16,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 5970 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:29:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5393 states. [2025-01-09 20:29:16,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5393 to 5199. [2025-01-09 20:29:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5199 states, 3491 states have (on average 1.264394156402177) internal successors, (4414), 3601 states have internal predecessors, (4414), 1324 states have call successors, (1324), 352 states have call predecessors, (1324), 349 states have return successors, (1333), 1298 states have call predecessors, (1333), 1322 states have call successors, (1333) [2025-01-09 20:29:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5199 states to 5199 states and 7071 transitions. [2025-01-09 20:29:16,287 INFO L78 Accepts]: Start accepts. Automaton has 5199 states and 7071 transitions. Word has length 68 [2025-01-09 20:29:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:16,287 INFO L471 AbstractCegarLoop]: Abstraction has 5199 states and 7071 transitions. [2025-01-09 20:29:16,287 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, (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:29:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5199 states and 7071 transitions. [2025-01-09 20:29:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 20:29:16,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:16,289 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:16,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:29:16,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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 34 more)] === [2025-01-09 20:29:16,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash -127981075, now seen corresponding path program 1 times [2025-01-09 20:29:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450596442] [2025-01-09 20:29:16,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:17,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 20:29:17,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 20:29:17,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:17,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450596442] [2025-01-09 20:29:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450596442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:17,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599255056] [2025-01-09 20:29:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:17,417 INFO L87 Difference]: Start difference. First operand 5199 states and 7071 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, (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:29:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:17,568 INFO L93 Difference]: Finished difference Result 5199 states and 7071 transitions. [2025-01-09 20:29:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:17,568 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, (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 74 [2025-01-09 20:29:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:17,600 INFO L225 Difference]: With dead ends: 5199 [2025-01-09 20:29:17,600 INFO L226 Difference]: Without dead ends: 5197 [2025-01-09 20:29:17,605 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:29:17,606 INFO L435 NwaCegarLoop]: 1970 mSDtfsCounter, 1945 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 3939 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:29:17,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 3939 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-01-09 20:29:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5197. [2025-01-09 20:29:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5197 states, 3490 states have (on average 1.2641833810888252) internal successors, (4412), 3599 states have internal predecessors, (4412), 1324 states have call successors, (1324), 352 states have call predecessors, (1324), 349 states have return successors, (1333), 1298 states have call predecessors, (1333), 1322 states have call successors, (1333) [2025-01-09 20:29:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5197 states to 5197 states and 7069 transitions. [2025-01-09 20:29:17,877 INFO L78 Accepts]: Start accepts. Automaton has 5197 states and 7069 transitions. Word has length 74 [2025-01-09 20:29:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:17,878 INFO L471 AbstractCegarLoop]: Abstraction has 5197 states and 7069 transitions. [2025-01-09 20:29:17,878 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, (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:29:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5197 states and 7069 transitions. [2025-01-09 20:29:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 20:29:17,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:17,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-01-09 20:29:17,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:29:17,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_lib_idr__not_initializedErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 20:29:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash -314038151, now seen corresponding path program 1 times [2025-01-09 20:29:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585442138] [2025-01-09 20:29:17,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:18,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 20:29:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 20:29:18,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:18,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:29:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585442138] [2025-01-09 20:29:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585442138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:29:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071694109] [2025-01-09 20:29:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:20,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:29:20,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:29:20,770 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:29:20,771 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:29:21,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 20:29:22,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 20:29:22,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:22,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:22,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 2022 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:29:22,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:29:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 20:29:22,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:29:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071694109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:29:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 18 [2025-01-09 20:29:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131002629] [2025-01-09 20:29:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:29:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:22,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:29:22,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:29:22,147 INFO L87 Difference]: Start difference. First operand 5197 states and 7069 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:29:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:23,223 INFO L93 Difference]: Finished difference Result 5440 states and 7334 transitions. [2025-01-09 20:29:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:29:23,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 77 [2025-01-09 20:29:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:23,249 INFO L225 Difference]: With dead ends: 5440 [2025-01-09 20:29:23,249 INFO L226 Difference]: Without dead ends: 5204 [2025-01-09 20:29:23,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2025-01-09 20:29:23,255 INFO L435 NwaCegarLoop]: 1949 mSDtfsCounter, 2 mSDsluCounter, 11644 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13593 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:23,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13593 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 20:29:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2025-01-09 20:29:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 5200. [2025-01-09 20:29:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 3493 states have (on average 1.263956484397366) internal successors, (4415), 3602 states have internal predecessors, (4415), 1324 states have call successors, (1324), 352 states have call predecessors, (1324), 349 states have return successors, (1333), 1298 states have call predecessors, (1333), 1322 states have call successors, (1333) [2025-01-09 20:29:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7072 transitions. [2025-01-09 20:29:23,447 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7072 transitions. Word has length 77 [2025-01-09 20:29:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 5200 states and 7072 transitions. [2025-01-09 20:29:23,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:29:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7072 transitions. [2025-01-09 20:29:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 20:29:23,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:23,451 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:23,463 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:29:23,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:29:23,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 34 more)] === [2025-01-09 20:29:23,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:23,653 INFO L85 PathProgramCache]: Analyzing trace with hash 433133026, now seen corresponding path program 1 times [2025-01-09 20:29:23,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:23,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794541299] [2025-01-09 20:29:23,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 20:29:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 20:29:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:24,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794541299] [2025-01-09 20:29:24,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794541299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:24,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:24,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:24,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894795911] [2025-01-09 20:29:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:24,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:24,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:24,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:24,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:24,517 INFO L87 Difference]: Start difference. First operand 5200 states and 7072 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, (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:29:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:24,685 INFO L93 Difference]: Finished difference Result 5200 states and 7072 transitions. [2025-01-09 20:29:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:24,686 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, (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 80 [2025-01-09 20:29:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:24,723 INFO L225 Difference]: With dead ends: 5200 [2025-01-09 20:29:24,726 INFO L226 Difference]: Without dead ends: 5198 [2025-01-09 20:29:24,731 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:29:24,731 INFO L435 NwaCegarLoop]: 1968 mSDtfsCounter, 1942 mSDsluCounter, 1967 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 3935 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:29:24,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 3935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5198 states. [2025-01-09 20:29:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5198 to 5198. [2025-01-09 20:29:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5198 states, 3492 states have (on average 1.263745704467354) internal successors, (4413), 3600 states have internal predecessors, (4413), 1324 states have call successors, (1324), 352 states have call predecessors, (1324), 349 states have return successors, (1333), 1298 states have call predecessors, (1333), 1322 states have call successors, (1333) [2025-01-09 20:29:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 7070 transitions. [2025-01-09 20:29:24,904 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 7070 transitions. Word has length 80 [2025-01-09 20:29:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:24,905 INFO L471 AbstractCegarLoop]: Abstraction has 5198 states and 7070 transitions. [2025-01-09 20:29:24,906 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, (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:29:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 7070 transitions. [2025-01-09 20:29:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 20:29:24,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:24,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:29:24,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:29:24,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_lib_idr__not_initializedErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 20:29:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1178610535, now seen corresponding path program 1 times [2025-01-09 20:29:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509208250] [2025-01-09 20:29:24,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:25,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 20:29:25,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 20:29:25,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:25,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 20:29:27,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:27,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509208250] [2025-01-09 20:29:27,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509208250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 20:29:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117465917] [2025-01-09 20:29:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:27,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 20:29:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:27,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 20:29:27,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2025-01-09 20:29:27,772 INFO L87 Difference]: Start difference. First operand 5198 states and 7070 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 20:29:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:30,401 INFO L93 Difference]: Finished difference Result 5567 states and 7473 transitions. [2025-01-09 20:29:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 20:29:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 86 [2025-01-09 20:29:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:30,439 INFO L225 Difference]: With dead ends: 5567 [2025-01-09 20:29:30,439 INFO L226 Difference]: Without dead ends: 5262 [2025-01-09 20:29:30,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:29:30,445 INFO L435 NwaCegarLoop]: 1942 mSDtfsCounter, 4 mSDsluCounter, 27110 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29052 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:30,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29052 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 20:29:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2025-01-09 20:29:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 5238. [2025-01-09 20:29:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 3520 states have (on average 1.2616477272727273) internal successors, (4441), 3628 states have internal predecessors, (4441), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 7122 transitions. [2025-01-09 20:29:30,630 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 7122 transitions. Word has length 86 [2025-01-09 20:29:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 5238 states and 7122 transitions. [2025-01-09 20:29:30,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 20:29:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 7122 transitions. [2025-01-09 20:29:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 20:29:30,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:30,631 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:30,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:29:30,632 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 34 more)] === [2025-01-09 20:29:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1859472886, now seen corresponding path program 1 times [2025-01-09 20:29:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880114261] [2025-01-09 20:29:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:31,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 20:29:31,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 20:29:31,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:31,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880114261] [2025-01-09 20:29:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880114261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807260955] [2025-01-09 20:29:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:31,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:31,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:31,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:31,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:31,549 INFO L87 Difference]: Start difference. First operand 5238 states and 7122 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, (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:29:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:31,718 INFO L93 Difference]: Finished difference Result 5238 states and 7122 transitions. [2025-01-09 20:29:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:31,719 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, (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 86 [2025-01-09 20:29:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:31,739 INFO L225 Difference]: With dead ends: 5238 [2025-01-09 20:29:31,739 INFO L226 Difference]: Without dead ends: 5236 [2025-01-09 20:29:31,743 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:29:31,744 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 1939 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 3931 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:29:31,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 3931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2025-01-09 20:29:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5236. [2025-01-09 20:29:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 3519 states have (on average 1.261437908496732) internal successors, (4439), 3626 states have internal predecessors, (4439), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7120 transitions. [2025-01-09 20:29:31,936 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7120 transitions. Word has length 86 [2025-01-09 20:29:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:31,936 INFO L471 AbstractCegarLoop]: Abstraction has 5236 states and 7120 transitions. [2025-01-09 20:29:31,936 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, (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:29:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7120 transitions. [2025-01-09 20:29:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 20:29:31,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:31,937 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:31,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:29:31,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 34 more)] === [2025-01-09 20:29:31,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 589158591, now seen corresponding path program 1 times [2025-01-09 20:29:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:31,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599855241] [2025-01-09 20:29:31,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:31,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:32,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 20:29:32,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 20:29:32,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:32,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599855241] [2025-01-09 20:29:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599855241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:32,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271389892] [2025-01-09 20:29:32,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:32,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:32,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:32,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:32,858 INFO L87 Difference]: Start difference. First operand 5236 states and 7120 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, (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:29:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:33,146 INFO L93 Difference]: Finished difference Result 5236 states and 7120 transitions. [2025-01-09 20:29:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:33,146 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, (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 92 [2025-01-09 20:29:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:33,168 INFO L225 Difference]: With dead ends: 5236 [2025-01-09 20:29:33,168 INFO L226 Difference]: Without dead ends: 5234 [2025-01-09 20:29:33,171 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:29:33,172 INFO L435 NwaCegarLoop]: 1964 mSDtfsCounter, 1936 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 3927 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:29:33,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 3927 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2025-01-09 20:29:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 5234. [2025-01-09 20:29:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 3518 states have (on average 1.2612279704377487) internal successors, (4437), 3624 states have internal predecessors, (4437), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7118 transitions. [2025-01-09 20:29:33,506 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7118 transitions. Word has length 92 [2025-01-09 20:29:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 7118 transitions. [2025-01-09 20:29:33,506 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, (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:29:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7118 transitions. [2025-01-09 20:29:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 20:29:33,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:33,510 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:29:33,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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 34 more)] === [2025-01-09 20:29:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1817899446, now seen corresponding path program 1 times [2025-01-09 20:29:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701356664] [2025-01-09 20:29:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:34,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 20:29:34,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 20:29:34,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:34,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701356664] [2025-01-09 20:29:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701356664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:34,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276906176] [2025-01-09 20:29:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:34,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:34,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:34,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:34,435 INFO L87 Difference]: Start difference. First operand 5234 states and 7118 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, (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:29:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:34,616 INFO L93 Difference]: Finished difference Result 5234 states and 7118 transitions. [2025-01-09 20:29:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:34,617 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, (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 98 [2025-01-09 20:29:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:34,636 INFO L225 Difference]: With dead ends: 5234 [2025-01-09 20:29:34,636 INFO L226 Difference]: Without dead ends: 5232 [2025-01-09 20:29:34,640 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:29:34,641 INFO L435 NwaCegarLoop]: 1962 mSDtfsCounter, 1933 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 3923 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:29:34,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 3923 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2025-01-09 20:29:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5232. [2025-01-09 20:29:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5232 states, 3517 states have (on average 1.261017912994029) internal successors, (4435), 3622 states have internal predecessors, (4435), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 7116 transitions. [2025-01-09 20:29:34,845 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 7116 transitions. Word has length 98 [2025-01-09 20:29:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:34,846 INFO L471 AbstractCegarLoop]: Abstraction has 5232 states and 7116 transitions. [2025-01-09 20:29:34,846 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, (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:29:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 7116 transitions. [2025-01-09 20:29:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 20:29:34,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:34,848 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:34,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:29:34,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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 34 more)] === [2025-01-09 20:29:34,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1050473645, now seen corresponding path program 1 times [2025-01-09 20:29:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076214969] [2025-01-09 20:29:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:35,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:29:35,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:29:35,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076214969] [2025-01-09 20:29:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076214969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:35,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:35,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750695904] [2025-01-09 20:29:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:35,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:35,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:35,751 INFO L87 Difference]: Start difference. First operand 5232 states and 7116 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:29:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:36,002 INFO L93 Difference]: Finished difference Result 5232 states and 7116 transitions. [2025-01-09 20:29:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 100 [2025-01-09 20:29:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:36,018 INFO L225 Difference]: With dead ends: 5232 [2025-01-09 20:29:36,018 INFO L226 Difference]: Without dead ends: 5230 [2025-01-09 20:29:36,020 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:29:36,020 INFO L435 NwaCegarLoop]: 1960 mSDtfsCounter, 1929 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 3919 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:29:36,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 3919 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2025-01-09 20:29:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5230. [2025-01-09 20:29:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 3516 states have (on average 1.2608077360637087) internal successors, (4433), 3620 states have internal predecessors, (4433), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 7114 transitions. [2025-01-09 20:29:36,226 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 7114 transitions. Word has length 100 [2025-01-09 20:29:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 5230 states and 7114 transitions. [2025-01-09 20:29:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:29:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 7114 transitions. [2025-01-09 20:29:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 20:29:36,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:36,228 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:29:36,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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 34 more)] === [2025-01-09 20:29:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1415238691, now seen corresponding path program 1 times [2025-01-09 20:29:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882142089] [2025-01-09 20:29:36,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:36,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:29:36,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:29:36,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:36,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882142089] [2025-01-09 20:29:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882142089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:37,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:37,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:37,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831341594] [2025-01-09 20:29:37,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:37,253 INFO L87 Difference]: Start difference. First operand 5230 states and 7114 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, (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:29:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:37,608 INFO L93 Difference]: Finished difference Result 5230 states and 7114 transitions. [2025-01-09 20:29:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:37,608 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, (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 106 [2025-01-09 20:29:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:37,631 INFO L225 Difference]: With dead ends: 5230 [2025-01-09 20:29:37,631 INFO L226 Difference]: Without dead ends: 5228 [2025-01-09 20:29:37,635 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:29:37,636 INFO L435 NwaCegarLoop]: 1958 mSDtfsCounter, 1928 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 3915 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:29:37,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 3915 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2025-01-09 20:29:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2025-01-09 20:29:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 3515 states have (on average 1.260597439544808) internal successors, (4431), 3618 states have internal predecessors, (4431), 1336 states have call successors, (1336), 352 states have call predecessors, (1336), 349 states have return successors, (1345), 1310 states have call predecessors, (1345), 1334 states have call successors, (1345) [2025-01-09 20:29:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 7112 transitions. [2025-01-09 20:29:37,893 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 7112 transitions. Word has length 106 [2025-01-09 20:29:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:37,895 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 7112 transitions. [2025-01-09 20:29:37,895 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, (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:29:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 7112 transitions. [2025-01-09 20:29:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 20:29:37,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:37,897 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-01-09 20:29:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:29:37,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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 34 more)] === [2025-01-09 20:29:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1901588053, now seen corresponding path program 1 times [2025-01-09 20:29:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442272823] [2025-01-09 20:29:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:38,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 20:29:38,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 20:29:38,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:38,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:29:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:39,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442272823] [2025-01-09 20:29:39,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442272823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:39,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:39,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:29:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626602113] [2025-01-09 20:29:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:39,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:29:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:39,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:29:39,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:39,159 INFO L87 Difference]: Start difference. First operand 5228 states and 7112 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:29:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:39,482 INFO L93 Difference]: Finished difference Result 5369 states and 7241 transitions. [2025-01-09 20:29:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:29:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 150 [2025-01-09 20:29:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:39,507 INFO L225 Difference]: With dead ends: 5369 [2025-01-09 20:29:39,507 INFO L226 Difference]: Without dead ends: 5367 [2025-01-09 20:29:39,510 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:29:39,510 INFO L435 NwaCegarLoop]: 1972 mSDtfsCounter, 1865 mSDsluCounter, 4047 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:39,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 6019 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:29:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5367 states. [2025-01-09 20:29:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5367 to 5359. [2025-01-09 20:29:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5359 states, 3609 states have (on average 1.258797450817401) internal successors, (4543), 3712 states have internal predecessors, (4543), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 7232 transitions. [2025-01-09 20:29:39,746 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 7232 transitions. Word has length 150 [2025-01-09 20:29:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:39,746 INFO L471 AbstractCegarLoop]: Abstraction has 5359 states and 7232 transitions. [2025-01-09 20:29:39,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:29:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 7232 transitions. [2025-01-09 20:29:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 20:29:39,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:39,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:29:39,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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 34 more)] === [2025-01-09 20:29:39,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -607409509, now seen corresponding path program 1 times [2025-01-09 20:29:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:39,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095586810] [2025-01-09 20:29:39,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:40,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 20:29:40,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 20:29:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095586810] [2025-01-09 20:29:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095586810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623513832] [2025-01-09 20:29:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:40,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:40,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:40,614 INFO L87 Difference]: Start difference. First operand 5359 states and 7232 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, (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:29:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:40,842 INFO L93 Difference]: Finished difference Result 5359 states and 7232 transitions. [2025-01-09 20:29:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:40,842 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, (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 112 [2025-01-09 20:29:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:40,862 INFO L225 Difference]: With dead ends: 5359 [2025-01-09 20:29:40,862 INFO L226 Difference]: Without dead ends: 5357 [2025-01-09 20:29:40,865 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:29:40,866 INFO L435 NwaCegarLoop]: 1956 mSDtfsCounter, 1925 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 3911 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:29:40,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 3911 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2025-01-09 20:29:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5357. [2025-01-09 20:29:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5357 states, 3608 states have (on average 1.2585920177383592) internal successors, (4541), 3710 states have internal predecessors, (4541), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 7230 transitions. [2025-01-09 20:29:41,141 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 7230 transitions. Word has length 112 [2025-01-09 20:29:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:41,141 INFO L471 AbstractCegarLoop]: Abstraction has 5357 states and 7230 transitions. [2025-01-09 20:29:41,142 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, (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:29:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 7230 transitions. [2025-01-09 20:29:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 20:29:41,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:41,143 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:29:41,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:29:41,143 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_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 34 more)] === [2025-01-09 20:29:41,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1498653841, now seen corresponding path program 1 times [2025-01-09 20:29:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:41,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818839910] [2025-01-09 20:29:41,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:41,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:41,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 20:29:41,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 20:29:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:29:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818839910] [2025-01-09 20:29:42,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818839910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:42,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:42,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:29:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391191585] [2025-01-09 20:29:42,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:42,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:29:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:29:42,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:29:42,710 INFO L87 Difference]: Start difference. First operand 5357 states and 7230 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:29:46,768 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:29:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:51,867 INFO L93 Difference]: Finished difference Result 10674 states and 14468 transitions. [2025-01-09 20:29:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:29:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2025-01-09 20:29:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:51,892 INFO L225 Difference]: With dead ends: 10674 [2025-01-09 20:29:51,892 INFO L226 Difference]: Without dead ends: 5357 [2025-01-09 20:29:51,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:29:51,917 INFO L435 NwaCegarLoop]: 1954 mSDtfsCounter, 1922 mSDsluCounter, 5115 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 7069 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:51,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 7069 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 20:29:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2025-01-09 20:29:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5357. [2025-01-09 20:29:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5357 states, 3608 states have (on average 1.2574833702882484) internal successors, (4537), 3710 states have internal predecessors, (4537), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 7226 transitions. [2025-01-09 20:29:52,199 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 7226 transitions. Word has length 155 [2025-01-09 20:29:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 5357 states and 7226 transitions. [2025-01-09 20:29:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:29:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 7226 transitions. [2025-01-09 20:29:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 20:29:52,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:52,202 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:29:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:29:52,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_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 34 more)] === [2025-01-09 20:29:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1498594259, now seen corresponding path program 1 times [2025-01-09 20:29:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397068456] [2025-01-09 20:29:52,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 20:29:53,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 20:29:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:29:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397068456] [2025-01-09 20:29:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397068456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181069609] [2025-01-09 20:29:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:53,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:53,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:53,629 INFO L87 Difference]: Start difference. First operand 5357 states and 7226 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 20:29:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:53,871 INFO L93 Difference]: Finished difference Result 5357 states and 7226 transitions. [2025-01-09 20:29:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 155 [2025-01-09 20:29:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:53,896 INFO L225 Difference]: With dead ends: 5357 [2025-01-09 20:29:53,896 INFO L226 Difference]: Without dead ends: 5355 [2025-01-09 20:29:53,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:53,901 INFO L435 NwaCegarLoop]: 1953 mSDtfsCounter, 0 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5855 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:29:53,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5855 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2025-01-09 20:29:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 5355. [2025-01-09 20:29:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5355 states, 3607 states have (on average 1.2564457998336567) internal successors, (4532), 3708 states have internal predecessors, (4532), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5355 states to 5355 states and 7221 transitions. [2025-01-09 20:29:54,175 INFO L78 Accepts]: Start accepts. Automaton has 5355 states and 7221 transitions. Word has length 155 [2025-01-09 20:29:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:54,175 INFO L471 AbstractCegarLoop]: Abstraction has 5355 states and 7221 transitions. [2025-01-09 20:29:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 20:29:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5355 states and 7221 transitions. [2025-01-09 20:29:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 20:29:54,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:54,178 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-01-09 20:29:54,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:29:54,178 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2025-01-09 20:29:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1367866035, now seen corresponding path program 1 times [2025-01-09 20:29:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381182292] [2025-01-09 20:29:54,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:54,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 20:29:54,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 20:29:54,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:54,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:29:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381182292] [2025-01-09 20:29:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381182292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:29:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055498533] [2025-01-09 20:29:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:54,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:29:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:54,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:29:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:29:54,999 INFO L87 Difference]: Start difference. First operand 5355 states and 7221 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:29:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:55,255 INFO L93 Difference]: Finished difference Result 10660 states and 14437 transitions. [2025-01-09 20:29:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:29:55,256 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 159 [2025-01-09 20:29:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:55,281 INFO L225 Difference]: With dead ends: 10660 [2025-01-09 20:29:55,281 INFO L226 Difference]: Without dead ends: 5345 [2025-01-09 20:29:55,301 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:29:55,302 INFO L435 NwaCegarLoop]: 1949 mSDtfsCounter, 1909 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 1949 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:29:55,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 1949 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2025-01-09 20:29:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 5345. [2025-01-09 20:29:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5345 states, 3598 states have (on average 1.254863813229572) internal successors, (4515), 3698 states have internal predecessors, (4515), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5345 states to 5345 states and 7204 transitions. [2025-01-09 20:29:55,579 INFO L78 Accepts]: Start accepts. Automaton has 5345 states and 7204 transitions. Word has length 159 [2025-01-09 20:29:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 5345 states and 7204 transitions. [2025-01-09 20:29:55,580 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:29:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5345 states and 7204 transitions. [2025-01-09 20:29:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 20:29:55,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:55,583 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:29:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:29:55,583 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 34 more)] === [2025-01-09 20:29:55,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2052925947, now seen corresponding path program 1 times [2025-01-09 20:29:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272794517] [2025-01-09 20:29:55,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:56,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 20:29:56,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 20:29:56,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:56,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:29:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:56,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272794517] [2025-01-09 20:29:56,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272794517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:56,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:29:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073614266] [2025-01-09 20:29:56,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:29:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:29:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:29:56,448 INFO L87 Difference]: Start difference. First operand 5345 states and 7204 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, (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:29:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:29:56,703 INFO L93 Difference]: Finished difference Result 5345 states and 7204 transitions. [2025-01-09 20:29:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:29:56,703 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, (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 118 [2025-01-09 20:29:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:29:56,722 INFO L225 Difference]: With dead ends: 5345 [2025-01-09 20:29:56,722 INFO L226 Difference]: Without dead ends: 5343 [2025-01-09 20:29:56,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:29:56,726 INFO L435 NwaCegarLoop]: 1946 mSDtfsCounter, 1914 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 3891 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:29:56,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 3891 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:29:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2025-01-09 20:29:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 5343. [2025-01-09 20:29:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 3597 states have (on average 1.2546566583263832) internal successors, (4513), 3696 states have internal predecessors, (4513), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:29:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7202 transitions. [2025-01-09 20:29:57,002 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7202 transitions. Word has length 118 [2025-01-09 20:29:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:29:57,003 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7202 transitions. [2025-01-09 20:29:57,003 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, (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:29:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7202 transitions. [2025-01-09 20:29:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 20:29:57,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:29:57,005 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-01-09 20:29:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:29:57,005 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 34 more)] === [2025-01-09 20:29:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:29:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2913592, now seen corresponding path program 1 times [2025-01-09 20:29:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:29:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753814937] [2025-01-09 20:29:57,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:29:57,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:29:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 20:29:57,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 20:29:57,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:29:57,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:29:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-01-09 20:29:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:29:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753814937] [2025-01-09 20:29:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753814937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:29:58,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:29:58,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:29:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149197524] [2025-01-09 20:29:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:29:58,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:29:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:29:58,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:29:58,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:29:58,143 INFO L87 Difference]: Start difference. First operand 5343 states and 7202 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:30:02,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:30:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:02,641 INFO L93 Difference]: Finished difference Result 5351 states and 7206 transitions. [2025-01-09 20:30:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:30:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2025-01-09 20:30:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:02,663 INFO L225 Difference]: With dead ends: 5351 [2025-01-09 20:30:02,663 INFO L226 Difference]: Without dead ends: 5349 [2025-01-09 20:30:02,667 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:30:02,667 INFO L435 NwaCegarLoop]: 1973 mSDtfsCounter, 99 mSDsluCounter, 5823 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 7796 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:30:02,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 7796 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 20:30:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2025-01-09 20:30:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 5343. [2025-01-09 20:30:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 3597 states have (on average 1.2535446205170975) internal successors, (4509), 3696 states have internal predecessors, (4509), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:30:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 7198 transitions. [2025-01-09 20:30:02,940 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 7198 transitions. Word has length 164 [2025-01-09 20:30:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:02,941 INFO L471 AbstractCegarLoop]: Abstraction has 5343 states and 7198 transitions. [2025-01-09 20:30:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 20:30:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 7198 transitions. [2025-01-09 20:30:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 20:30:02,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:02,942 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:30:02,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:30:02,942 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 34 more)] === [2025-01-09 20:30:02,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1756100675, now seen corresponding path program 1 times [2025-01-09 20:30:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245133727] [2025-01-09 20:30:02,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 20:30:03,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 20:30:03,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:03,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:30:03,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:03,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245133727] [2025-01-09 20:30:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245133727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24037470] [2025-01-09 20:30:03,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:03,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:03,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:03,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:03,844 INFO L87 Difference]: Start difference. First operand 5343 states and 7198 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, (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:30:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:04,136 INFO L93 Difference]: Finished difference Result 5343 states and 7198 transitions. [2025-01-09 20:30:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:04,136 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, (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 124 [2025-01-09 20:30:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:04,154 INFO L225 Difference]: With dead ends: 5343 [2025-01-09 20:30:04,154 INFO L226 Difference]: Without dead ends: 5341 [2025-01-09 20:30:04,157 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:30:04,158 INFO L435 NwaCegarLoop]: 1944 mSDtfsCounter, 1911 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 3887 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:30:04,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1911 Valid, 3887 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2025-01-09 20:30:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 5341. [2025-01-09 20:30:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5341 states, 3596 states have (on average 1.253337041156841) internal successors, (4507), 3694 states have internal predecessors, (4507), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:30:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5341 states to 5341 states and 7196 transitions. [2025-01-09 20:30:04,490 INFO L78 Accepts]: Start accepts. Automaton has 5341 states and 7196 transitions. Word has length 124 [2025-01-09 20:30:04,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:04,490 INFO L471 AbstractCegarLoop]: Abstraction has 5341 states and 7196 transitions. [2025-01-09 20:30:04,490 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, (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:30:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5341 states and 7196 transitions. [2025-01-09 20:30:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 20:30:04,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:04,491 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:30:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:30:04,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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 34 more)] === [2025-01-09 20:30:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 285255485, now seen corresponding path program 1 times [2025-01-09 20:30:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608746044] [2025-01-09 20:30:04,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:30:05,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 20:30:05,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 20:30:05,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:30:05,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:30:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:30:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:30:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608746044] [2025-01-09 20:30:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608746044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:30:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:30:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:30:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836122444] [2025-01-09 20:30:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:30:05,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:30:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:30:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:30:05,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:30:05,315 INFO L87 Difference]: Start difference. First operand 5341 states and 7196 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, (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:30:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:30:05,602 INFO L93 Difference]: Finished difference Result 5341 states and 7196 transitions. [2025-01-09 20:30:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:30:05,603 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, (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 130 [2025-01-09 20:30:05,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:30:05,624 INFO L225 Difference]: With dead ends: 5341 [2025-01-09 20:30:05,624 INFO L226 Difference]: Without dead ends: 5339 [2025-01-09 20:30:05,627 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:30:05,628 INFO L435 NwaCegarLoop]: 1942 mSDtfsCounter, 1908 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 3883 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:30:05,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 3883 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:30:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2025-01-09 20:30:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 5339. [2025-01-09 20:30:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5339 states, 3595 states have (on average 1.2531293463143254) internal successors, (4505), 3692 states have internal predecessors, (4505), 1340 states have call successors, (1340), 385 states have call predecessors, (1340), 382 states have return successors, (1349), 1314 states have call predecessors, (1349), 1338 states have call successors, (1349) [2025-01-09 20:30:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5339 states to 5339 states and 7194 transitions. [2025-01-09 20:30:05,990 INFO L78 Accepts]: Start accepts. Automaton has 5339 states and 7194 transitions. Word has length 130 [2025-01-09 20:30:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:30:05,990 INFO L471 AbstractCegarLoop]: Abstraction has 5339 states and 7194 transitions. [2025-01-09 20:30:05,990 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, (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:30:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5339 states and 7194 transitions. [2025-01-09 20:30:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 20:30:05,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:30:05,991 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:30:05,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:30:05,991 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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 34 more)] === [2025-01-09 20:30:05,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:30:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash -521309741, now seen corresponding path program 1 times [2025-01-09 20:30:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:30:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328827244] [2025-01-09 20:30:05,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:30:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms