./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:13:38,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:13:38,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:13:38,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:13:38,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:13:38,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:13:38,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:13:38,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:13:38,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:13:38,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:13:38,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:13:38,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:13:38,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:13:38,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:13:38,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:13:38,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:13:38,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:13:38,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:13:38,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:13:38,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:13:38,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:13:38,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:13:38,516 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/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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2025-03-17 10:13:38,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:13:38,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:13:38,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:13:38,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:13:38,741 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:13:38,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-03-17 10:13:39,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1930e4d9e/a2b40d4e4a4d4de4bc4dd3001ec330e6/FLAG07cf9f3f7 [2025-03-17 10:13:40,381 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:13:40,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-03-17 10:13:40,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1930e4d9e/a2b40d4e4a4d4de4bc4dd3001ec330e6/FLAG07cf9f3f7 [2025-03-17 10:13:40,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1930e4d9e/a2b40d4e4a4d4de4bc4dd3001ec330e6 [2025-03-17 10:13:40,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:13:40,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:13:40,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:13:40,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:13:40,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:13:40,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:13:40" (1/1) ... [2025-03-17 10:13:40,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:40, skipping insertion in model container [2025-03-17 10:13:40,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:13:40" (1/1) ... [2025-03-17 10:13:41,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:13:42,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-03-17 10:13:42,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-03-17 10:13:42,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-03-17 10:13:42,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-03-17 10:13:42,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-03-17 10:13:42,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-03-17 10:13:42,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-03-17 10:13:42,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-03-17 10:13:42,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-03-17 10:13:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-03-17 10:13:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-03-17 10:13:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-03-17 10:13:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-03-17 10:13:42,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-03-17 10:13:42,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-03-17 10:13:42,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-03-17 10:13:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-03-17 10:13:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-03-17 10:13:42,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-03-17 10:13:42,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-03-17 10:13:42,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-03-17 10:13:42,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-03-17 10:13:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-03-17 10:13:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-03-17 10:13:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-03-17 10:13:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-03-17 10:13:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-03-17 10:13:42,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-03-17 10:13:42,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-03-17 10:13:42,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-03-17 10:13:42,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-03-17 10:13:42,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-03-17 10:13:42,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-03-17 10:13:42,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-03-17 10:13:42,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-03-17 10:13:42,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-03-17 10:13:42,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-03-17 10:13:42,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-03-17 10:13:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-03-17 10:13:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-03-17 10:13:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-03-17 10:13:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-03-17 10:13:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-03-17 10:13:42,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-03-17 10:13:42,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-03-17 10:13:42,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-03-17 10:13:42,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-03-17 10:13:42,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-03-17 10:13:42,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-03-17 10:13:42,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-03-17 10:13:42,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-03-17 10:13:42,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-03-17 10:13:42,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-03-17 10:13:42,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-03-17 10:13:42,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-03-17 10:13:42,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-03-17 10:13:42,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-03-17 10:13:42,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-03-17 10:13:42,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-03-17 10:13:42,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-03-17 10:13:42,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-03-17 10:13:42,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-03-17 10:13:42,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-03-17 10:13:42,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-03-17 10:13:42,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-03-17 10:13:42,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-03-17 10:13:42,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-03-17 10:13:42,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-03-17 10:13:42,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:13:42,693 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:13:42,761 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4644] [2025-03-17 10:13:42,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4799] [2025-03-17 10:13:42,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [5192] [2025-03-17 10:13:42,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-03-17 10:13:42,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-03-17 10:13:42,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-03-17 10:13:42,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-03-17 10:13:42,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-03-17 10:13:42,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-03-17 10:13:42,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-03-17 10:13:42,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-03-17 10:13:42,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-03-17 10:13:42,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-03-17 10:13:42,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-03-17 10:13:42,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-03-17 10:13:42,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-03-17 10:13:42,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-03-17 10:13:42,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-03-17 10:13:42,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-03-17 10:13:42,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-03-17 10:13:42,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-03-17 10:13:42,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-03-17 10:13:42,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-03-17 10:13:42,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-03-17 10:13:42,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-03-17 10:13:42,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-03-17 10:13:42,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-03-17 10:13:42,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-03-17 10:13:42,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-03-17 10:13:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-03-17 10:13:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-03-17 10:13:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-03-17 10:13:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-03-17 10:13:42,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-03-17 10:13:42,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-03-17 10:13:42,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-03-17 10:13:42,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-03-17 10:13:42,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-03-17 10:13:42,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-03-17 10:13:42,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-03-17 10:13:42,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-03-17 10:13:42,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-03-17 10:13:42,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-03-17 10:13:42,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-03-17 10:13:42,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-03-17 10:13:42,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-03-17 10:13:42,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-03-17 10:13:42,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-03-17 10:13:42,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-03-17 10:13:42,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-03-17 10:13:42,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-03-17 10:13:42,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-03-17 10:13:42,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-03-17 10:13:42,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-03-17 10:13:42,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-03-17 10:13:42,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-03-17 10:13:42,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-03-17 10:13:42,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-03-17 10:13:42,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-03-17 10:13:42,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-03-17 10:13:42,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-03-17 10:13:42,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-03-17 10:13:42,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-03-17 10:13:42,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-03-17 10:13:42,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-03-17 10:13:42,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-03-17 10:13:42,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-03-17 10:13:42,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-03-17 10:13:42,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-03-17 10:13:42,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-03-17 10:13:42,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-03-17 10:13:42,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-03-17 10:13:42,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-03-17 10:13:42,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-03-17 10:13:42,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-03-17 10:13:42,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-03-17 10:13:42,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-03-17 10:13:42,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-03-17 10:13:42,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-03-17 10:13:42,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:13:42,999 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:13:43,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43 WrapperNode [2025-03-17 10:13:43,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:13:43,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:13:43,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:13:43,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:13:43,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,138 INFO L138 Inliner]: procedures = 526, calls = 1370, calls flagged for inlining = 224, calls inlined = 135, statements flattened = 2492 [2025-03-17 10:13:43,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:13:43,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:13:43,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:13:43,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:13:43,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,380 INFO L175 MemorySlicer]: Split 355 memory accesses to 11 slices as follows [7, 1, 28, 2, 23, 3, 2, 3, 4, 5, 277]. 78 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [7, 1, 0, 2, 0, 0, 0, 0, 4, 0, 26]. The 184 writes are split as follows [0, 0, 24, 0, 23, 0, 0, 0, 0, 5, 132]. [2025-03-17 10:13:43,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:13:43,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:13:43,498 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:13:43,498 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:13:43,499 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (1/1) ... [2025-03-17 10:13:43,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:13:43,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:13:43,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:13:43,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:13:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:13:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:13:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 10:13:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 10:13:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:13:43,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:13:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-17 10:13:43,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-17 10:13:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:13:43,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:13:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-17 10:13:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-17 10:13:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-03-17 10:13:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 10:13:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 10:13:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2025-03-17 10:13:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:13:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:13:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-03-17 10:13:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:13:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:13:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2025-03-17 10:13:43,551 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 10:13:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 10:13:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:13:43,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:13:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-03-17 10:13:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 10:13:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2025-03-17 10:13:43,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2025-03-17 10:13:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2025-03-17 10:13:43,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2025-03-17 10:13:43,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:13:43,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:13:43,991 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4347: havoc dev_get_drvdata_#t~mem60#1.base, dev_get_drvdata_#t~mem60#1.offset; [2025-03-17 10:13:44,065 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 10:13:44,115 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4446: havoc #t~mem93;havoc #t~bitwise94; [2025-03-17 10:13:44,132 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4259: havoc #t~mem42; [2025-03-17 10:13:44,217 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11215: havoc #t~nondet552; [2025-03-17 10:13:44,338 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11175: havoc #t~nondet550; [2025-03-17 10:13:44,343 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11230: havoc #t~nondet555; [2025-03-17 10:13:44,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11219: havoc #t~nondet553; [2025-03-17 10:13:44,420 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11226: havoc #t~nondet554; [2025-03-17 10:13:44,429 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11171: havoc #t~nondet549; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4563: call ULTIMATE.dealloc(tower_open_~#reset_reply~0#1.base, tower_open_~#reset_reply~0#1.offset);havoc tower_open_~#reset_reply~0#1.base, tower_open_~#reset_reply~0#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11239: havoc usb_find_interface_#t~ret556#1.base, usb_find_interface_#t~ret556#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5360: call ULTIMATE.dealloc(tower_probe_~#get_version_reply~0#1.base, tower_probe_~#get_version_reply~0#1.offset);havoc tower_probe_~#get_version_reply~0#1.base, tower_probe_~#get_version_reply~0#1.offset;call ULTIMATE.dealloc(tower_probe_~#__key~0#1.base, tower_probe_~#__key~0#1.offset);havoc tower_probe_~#__key~0#1.base, tower_probe_~#__key~0#1.offset;call ULTIMATE.dealloc(tower_probe_~#__key___0~0#1.base, tower_probe_~#__key___0~0#1.offset);havoc tower_probe_~#__key___0~0#1.base, tower_probe_~#__key___0~0#1.offset;call ULTIMATE.dealloc(tower_probe_~#__key___1~0#1.base, tower_probe_~#__key___1~0#1.offset);havoc tower_probe_~#__key___1~0#1.base, tower_probe_~#__key___1~0#1.offset;call ULTIMATE.dealloc(tower_probe_~#__key___2~0#1.base, tower_probe_~#__key___2~0#1.offset);havoc tower_probe_~#__key___2~0#1.base, tower_probe_~#__key___2~0#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4241: havoc kobject_name_#t~mem39#1.base, kobject_name_#t~mem39#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4671: call ULTIMATE.dealloc(tower_release_~#descriptor~1#1.base, tower_release_~#descriptor~1#1.offset);havoc tower_release_~#descriptor~1#1.base, tower_release_~#descriptor~1#1.offset;call ULTIMATE.dealloc(tower_release_~#__wait~0#1.base, tower_release_~#__wait~0#1.offset);havoc tower_release_~#__wait~0#1.base, tower_release_~#__wait~0#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6489: havoc ldv_usb_submit_urb_118_#t~nondet374#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11246: havoc usb_register_dev_#t~nondet557#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6622-1: ldv_usb_register_driver_130_#res#1 := ldv_usb_register_driver_130_~ldv_func_res~0#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc usb_endpoint_dir_in_#t~mem40#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: havoc usb_register_driver_#t~nondet558#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6163-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4875: call ULTIMATE.dealloc(tower_read_~#descriptor~2#1.base, tower_read_~#descriptor~2#1.offset);havoc tower_read_~#descriptor~2#1.base, tower_read_~#descriptor~2#1.offset;call ULTIMATE.dealloc(tower_read_~#__wait~1#1.base, tower_read_~#__wait~1#1.offset);havoc tower_read_~#__wait~1#1.base, tower_read_~#__wait~1#1.offset; [2025-03-17 10:13:49,448 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4253: havoc usb_endpoint_xfer_int_#t~mem41#1; [2025-03-17 10:13:49,449 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5053: call ULTIMATE.dealloc(tower_write_~#descriptor~3#1.base, tower_write_~#descriptor~3#1.offset);havoc tower_write_~#descriptor~3#1.base, tower_write_~#descriptor~3#1.offset;call ULTIMATE.dealloc(tower_write_~#__wait~2#1.base, tower_write_~#__wait~2#1.offset);havoc tower_write_~#__wait~2#1.base, tower_write_~#__wait~2#1.offset;call ULTIMATE.dealloc(tower_write_~#descriptor___0~0#1.base, tower_write_~#descriptor___0~0#1.offset);havoc tower_write_~#descriptor___0~0#1.base, tower_write_~#descriptor___0~0#1.offset; [2025-03-17 10:13:49,449 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6376: havoc ldv_usb_submit_urb_104_#t~nondet370#1; [2025-03-17 10:13:49,449 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11199: havoc kasprintf_#t~ret551#1.base, kasprintf_#t~ret551#1.offset; [2025-03-17 10:13:49,449 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4362: havoc iminor_#t~mem65#1; [2025-03-17 10:13:49,745 INFO L? ?]: Removed 1016 outVars from TransFormulas that were not future-live. [2025-03-17 10:13:49,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:13:49,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:13:49,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:13:49,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:13:49 BoogieIcfgContainer [2025-03-17 10:13:49,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:13:49,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:13:49,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:13:49,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:13:49,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:13:40" (1/3) ... [2025-03-17 10:13:49,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bb29e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:13:49, skipping insertion in model container [2025-03-17 10:13:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:13:43" (2/3) ... [2025-03-17 10:13:49,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bb29e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:13:49, skipping insertion in model container [2025-03-17 10:13:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:13:49" (3/3) ... [2025-03-17 10:13:49,796 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-03-17 10:13:49,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:13:49,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i that has 81 procedures, 1010 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-17 10:13:49,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:13:49,876 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;@4a85a509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:13:49,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 10:13:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 1009 states, 635 states have (on average 1.3086614173228346) internal successors, (831), 688 states have internal predecessors, (831), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 249 states have call predecessors, (259), 259 states have call successors, (259) [2025-03-17 10:13:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:13:49,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:49,888 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:49,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:49,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1610093616, now seen corresponding path program 1 times [2025-03-17 10:13:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494346188] [2025-03-17 10:13:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:49,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:50,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:13:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:13:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:51,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494346188] [2025-03-17 10:13:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494346188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113696550] [2025-03-17 10:13:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:51,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:51,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:51,419 INFO L87 Difference]: Start difference. First operand has 1009 states, 635 states have (on average 1.3086614173228346) internal successors, (831), 688 states have internal predecessors, (831), 264 states have call successors, (264), 80 states have call predecessors, (264), 79 states have return successors, (259), 249 states have call predecessors, (259), 259 states have call successors, (259) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-17 10:13:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:51,635 INFO L93 Difference]: Finished difference Result 1976 states and 2745 transitions. [2025-03-17 10:13:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 65 [2025-03-17 10:13:51,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:51,652 INFO L225 Difference]: With dead ends: 1976 [2025-03-17 10:13:51,652 INFO L226 Difference]: Without dead ends: 992 [2025-03-17 10:13:51,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:51,661 INFO L435 NwaCegarLoop]: 1302 mSDtfsCounter, 1288 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:51,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 2603 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-03-17 10:13:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2025-03-17 10:13:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 626 states have (on average 1.2460063897763578) internal successors, (780), 674 states have internal predecessors, (780), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1296 transitions. [2025-03-17 10:13:51,767 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1296 transitions. Word has length 65 [2025-03-17 10:13:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:51,771 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1296 transitions. [2025-03-17 10:13:51,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-17 10:13:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1296 transitions. [2025-03-17 10:13:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 10:13:51,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:51,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:51,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:13:51,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:51,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1787665522, now seen corresponding path program 1 times [2025-03-17 10:13:51,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:51,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211175049] [2025-03-17 10:13:51,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:51,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:52,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:13:52,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:13:52,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:52,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:52,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:52,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211175049] [2025-03-17 10:13:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211175049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:52,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991222705] [2025-03-17 10:13:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:52,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:52,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:52,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:52,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:52,814 INFO L87 Difference]: Start difference. First operand 992 states and 1296 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 10:13:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:52,936 INFO L93 Difference]: Finished difference Result 992 states and 1296 transitions. [2025-03-17 10:13:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:52,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 71 [2025-03-17 10:13:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:52,944 INFO L225 Difference]: With dead ends: 992 [2025-03-17 10:13:52,944 INFO L226 Difference]: Without dead ends: 990 [2025-03-17 10:13:52,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:52,945 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 1267 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:52,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 2563 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-17 10:13:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2025-03-17 10:13:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 625 states have (on average 1.2448) internal successors, (778), 672 states have internal predecessors, (778), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1294 transitions. [2025-03-17 10:13:52,999 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1294 transitions. Word has length 71 [2025-03-17 10:13:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1294 transitions. [2025-03-17 10:13:53,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 10:13:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1294 transitions. [2025-03-17 10:13:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 10:13:53,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:53,002 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:53,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:13:53,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:53,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1508574468, now seen corresponding path program 1 times [2025-03-17 10:13:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259233727] [2025-03-17 10:13:53,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:53,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:53,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:13:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:13:53,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:53,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:54,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259233727] [2025-03-17 10:13:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259233727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702421556] [2025-03-17 10:13:54,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:54,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:54,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:54,003 INFO L87 Difference]: Start difference. First operand 990 states and 1294 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-03-17 10:13:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:54,131 INFO L93 Difference]: Finished difference Result 990 states and 1294 transitions. [2025-03-17 10:13:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:54,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 77 [2025-03-17 10:13:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:54,139 INFO L225 Difference]: With dead ends: 990 [2025-03-17 10:13:54,139 INFO L226 Difference]: Without dead ends: 988 [2025-03-17 10:13:54,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:54,140 INFO L435 NwaCegarLoop]: 1280 mSDtfsCounter, 1264 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:54,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 2559 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-17 10:13:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2025-03-17 10:13:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 624 states have (on average 1.2435897435897436) internal successors, (776), 670 states have internal predecessors, (776), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1292 transitions. [2025-03-17 10:13:54,184 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1292 transitions. Word has length 77 [2025-03-17 10:13:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:54,185 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1292 transitions. [2025-03-17 10:13:54,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-03-17 10:13:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1292 transitions. [2025-03-17 10:13:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:13:54,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:54,189 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:13:54,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -483763756, now seen corresponding path program 1 times [2025-03-17 10:13:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89373220] [2025-03-17 10:13:54,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:54,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:13:54,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:13:54,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:54,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89373220] [2025-03-17 10:13:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89373220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:54,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944569886] [2025-03-17 10:13:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:54,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:54,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:54,988 INFO L87 Difference]: Start difference. First operand 988 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-03-17 10:13:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:55,093 INFO L93 Difference]: Finished difference Result 988 states and 1292 transitions. [2025-03-17 10:13:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:55,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 83 [2025-03-17 10:13:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:55,099 INFO L225 Difference]: With dead ends: 988 [2025-03-17 10:13:55,099 INFO L226 Difference]: Without dead ends: 986 [2025-03-17 10:13:55,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:55,100 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 1261 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:55,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2555 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-03-17 10:13:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-03-17 10:13:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 623 states have (on average 1.2423756019261638) internal successors, (774), 668 states have internal predecessors, (774), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1290 transitions. [2025-03-17 10:13:55,141 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1290 transitions. Word has length 83 [2025-03-17 10:13:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:55,142 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1290 transitions. [2025-03-17 10:13:55,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-03-17 10:13:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1290 transitions. [2025-03-17 10:13:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:13:55,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:55,143 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:13:55,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:55,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 484321526, now seen corresponding path program 1 times [2025-03-17 10:13:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:55,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429946714] [2025-03-17 10:13:55,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:13:55,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:13:55,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:55,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:56,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429946714] [2025-03-17 10:13:56,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429946714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:56,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:56,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532451344] [2025-03-17 10:13:56,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:56,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:56,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:56,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:56,039 INFO L87 Difference]: Start difference. First operand 986 states and 1290 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-17 10:13:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:56,138 INFO L93 Difference]: Finished difference Result 986 states and 1290 transitions. [2025-03-17 10:13:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 89 [2025-03-17 10:13:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:56,144 INFO L225 Difference]: With dead ends: 986 [2025-03-17 10:13:56,144 INFO L226 Difference]: Without dead ends: 984 [2025-03-17 10:13:56,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:56,146 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 1258 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:56,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 2551 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:13:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-03-17 10:13:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2025-03-17 10:13:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 622 states have (on average 1.2411575562700965) internal successors, (772), 666 states have internal predecessors, (772), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1288 transitions. [2025-03-17 10:13:56,185 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1288 transitions. Word has length 89 [2025-03-17 10:13:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:56,185 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1288 transitions. [2025-03-17 10:13:56,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-17 10:13:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1288 transitions. [2025-03-17 10:13:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 10:13:56,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:56,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:56,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:13:56,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1628962414, now seen corresponding path program 1 times [2025-03-17 10:13:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:56,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383148375] [2025-03-17 10:13:56,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 10:13:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:13:56,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:56,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383148375] [2025-03-17 10:13:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383148375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495489337] [2025-03-17 10:13:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:56,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:56,897 INFO L87 Difference]: Start difference. First operand 984 states and 1288 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03-17 10:13:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:57,002 INFO L93 Difference]: Finished difference Result 984 states and 1288 transitions. [2025-03-17 10:13:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:57,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 95 [2025-03-17 10:13:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:57,008 INFO L225 Difference]: With dead ends: 984 [2025-03-17 10:13:57,008 INFO L226 Difference]: Without dead ends: 982 [2025-03-17 10:13:57,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:57,009 INFO L435 NwaCegarLoop]: 1274 mSDtfsCounter, 1255 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:57,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2547 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:13:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-03-17 10:13:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2025-03-17 10:13:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 621 states have (on average 1.2399355877616747) internal successors, (770), 664 states have internal predecessors, (770), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1286 transitions. [2025-03-17 10:13:57,056 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1286 transitions. Word has length 95 [2025-03-17 10:13:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:57,057 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1286 transitions. [2025-03-17 10:13:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-03-17 10:13:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1286 transitions. [2025-03-17 10:13:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 10:13:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:57,060 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:57,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:13:57,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:57,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:57,062 INFO L85 PathProgramCache]: Analyzing trace with hash -254416862, now seen corresponding path program 1 times [2025-03-17 10:13:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:57,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060864410] [2025-03-17 10:13:57,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:57,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 10:13:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 10:13:57,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:57,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060864410] [2025-03-17 10:13:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060864410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608704064] [2025-03-17 10:13:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:57,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:57,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:57,878 INFO L87 Difference]: Start difference. First operand 982 states and 1286 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03-17 10:13:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:58,054 INFO L93 Difference]: Finished difference Result 982 states and 1286 transitions. [2025-03-17 10:13:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 101 [2025-03-17 10:13:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:58,060 INFO L225 Difference]: With dead ends: 982 [2025-03-17 10:13:58,060 INFO L226 Difference]: Without dead ends: 980 [2025-03-17 10:13:58,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:58,063 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 1252 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:58,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 2543 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-03-17 10:13:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2025-03-17 10:13:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 620 states have (on average 1.238709677419355) internal successors, (768), 662 states have internal predecessors, (768), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1284 transitions. [2025-03-17 10:13:58,137 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1284 transitions. Word has length 101 [2025-03-17 10:13:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:58,137 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1284 transitions. [2025-03-17 10:13:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03-17 10:13:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1284 transitions. [2025-03-17 10:13:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 10:13:58,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:58,140 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:58,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:13:58,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1329856449, now seen corresponding path program 1 times [2025-03-17 10:13:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012706439] [2025-03-17 10:13:58,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:58,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 10:13:58,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 10:13:58,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012706439] [2025-03-17 10:13:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012706439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:59,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765902980] [2025-03-17 10:13:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:59,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:59,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:59,052 INFO L87 Difference]: Start difference. First operand 980 states and 1284 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-17 10:13:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:13:59,199 INFO L93 Difference]: Finished difference Result 980 states and 1284 transitions. [2025-03-17 10:13:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:13:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 107 [2025-03-17 10:13:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:13:59,205 INFO L225 Difference]: With dead ends: 980 [2025-03-17 10:13:59,205 INFO L226 Difference]: Without dead ends: 978 [2025-03-17 10:13:59,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:13:59,206 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 1249 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 2539 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:13:59,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 2539 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:13:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-17 10:13:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-03-17 10:13:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 619 states have (on average 1.2374798061389338) internal successors, (766), 660 states have internal predecessors, (766), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:13:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1282 transitions. [2025-03-17 10:13:59,257 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1282 transitions. Word has length 107 [2025-03-17 10:13:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:13:59,258 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1282 transitions. [2025-03-17 10:13:59,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-03-17 10:13:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1282 transitions. [2025-03-17 10:13:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:13:59,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:13:59,260 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:13:59,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:13:59,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:13:59,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:13:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1908174179, now seen corresponding path program 1 times [2025-03-17 10:13:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:13:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554408322] [2025-03-17 10:13:59,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:13:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:13:59,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:13:59,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:13:59,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:13:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:13:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:13:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:13:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554408322] [2025-03-17 10:13:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554408322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:13:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:13:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:13:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440226361] [2025-03-17 10:13:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:13:59,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:13:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:13:59,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:13:59,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:13:59,984 INFO L87 Difference]: Start difference. First operand 978 states and 1282 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, (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-03-17 10:14:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:00,120 INFO L93 Difference]: Finished difference Result 978 states and 1282 transitions. [2025-03-17 10:14:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:00,121 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, (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 109 [2025-03-17 10:14:00,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:00,126 INFO L225 Difference]: With dead ends: 978 [2025-03-17 10:14:00,126 INFO L226 Difference]: Without dead ends: 976 [2025-03-17 10:14:00,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:00,127 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 1245 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:00,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2535 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:00,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-17 10:14:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-03-17 10:14:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 618 states have (on average 1.2362459546925566) internal successors, (764), 658 states have internal predecessors, (764), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1280 transitions. [2025-03-17 10:14:00,178 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1280 transitions. Word has length 109 [2025-03-17 10:14:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:00,178 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1280 transitions. [2025-03-17 10:14:00,178 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, (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-03-17 10:14:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1280 transitions. [2025-03-17 10:14:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 10:14:00,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:00,180 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:14:00,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1518693661, now seen corresponding path program 1 times [2025-03-17 10:14:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156233465] [2025-03-17 10:14:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 10:14:00,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 10:14:00,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:00,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156233465] [2025-03-17 10:14:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156233465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291948038] [2025-03-17 10:14:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:00,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:00,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:00,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:00,915 INFO L87 Difference]: Start difference. First operand 976 states and 1280 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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-03-17 10:14:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:01,022 INFO L93 Difference]: Finished difference Result 976 states and 1280 transitions. [2025-03-17 10:14:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:01,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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 115 [2025-03-17 10:14:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:01,028 INFO L225 Difference]: With dead ends: 976 [2025-03-17 10:14:01,028 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 10:14:01,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:01,030 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 1244 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:01,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 2531 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 10:14:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2025-03-17 10:14:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 617 states have (on average 1.2350081037277147) internal successors, (762), 656 states have internal predecessors, (762), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1278 transitions. [2025-03-17 10:14:01,085 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1278 transitions. Word has length 115 [2025-03-17 10:14:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:01,086 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1278 transitions. [2025-03-17 10:14:01,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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-03-17 10:14:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1278 transitions. [2025-03-17 10:14:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 10:14:01,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:01,087 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:01,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:14:01,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1198025434, now seen corresponding path program 1 times [2025-03-17 10:14:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063066061] [2025-03-17 10:14:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:01,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 10:14:01,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 10:14:01,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:01,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063066061] [2025-03-17 10:14:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063066061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:14:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245886511] [2025-03-17 10:14:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:14:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:14:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:03,011 INFO L87 Difference]: Start difference. First operand 974 states and 1278 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:14:07,032 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-03-17 10:14:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:09,390 INFO L93 Difference]: Finished difference Result 1914 states and 2513 transitions. [2025-03-17 10:14:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:14:09,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2025-03-17 10:14:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:09,399 INFO L225 Difference]: With dead ends: 1914 [2025-03-17 10:14:09,399 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 10:14:09,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:14:09,406 INFO L435 NwaCegarLoop]: 1264 mSDtfsCounter, 1241 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 4536 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:09,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 4536 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-03-17 10:14:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 10:14:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2025-03-17 10:14:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 617 states have (on average 1.233387358184765) internal successors, (761), 656 states have internal predecessors, (761), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1277 transitions. [2025-03-17 10:14:09,460 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1277 transitions. Word has length 159 [2025-03-17 10:14:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:09,462 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1277 transitions. [2025-03-17 10:14:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:14:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1277 transitions. [2025-03-17 10:14:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 10:14:09,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:09,465 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:14:09,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1198055225, now seen corresponding path program 1 times [2025-03-17 10:14:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:09,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574860521] [2025-03-17 10:14:09,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:10,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 10:14:10,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 10:14:10,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:10,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:10,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574860521] [2025-03-17 10:14:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574860521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899020486] [2025-03-17 10:14:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:10,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:10,539 INFO L87 Difference]: Start difference. First operand 974 states and 1277 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 10:14:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:10,693 INFO L93 Difference]: Finished difference Result 974 states and 1277 transitions. [2025-03-17 10:14:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 159 [2025-03-17 10:14:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:10,698 INFO L225 Difference]: With dead ends: 974 [2025-03-17 10:14:10,698 INFO L226 Difference]: Without dead ends: 972 [2025-03-17 10:14:10,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:10,700 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 0 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:10,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3786 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-17 10:14:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2025-03-17 10:14:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 616 states have (on average 1.2321428571428572) internal successors, (759), 654 states have internal predecessors, (759), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1275 transitions. [2025-03-17 10:14:10,770 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1275 transitions. Word has length 159 [2025-03-17 10:14:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1275 transitions. [2025-03-17 10:14:10,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 10:14:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1275 transitions. [2025-03-17 10:14:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 10:14:10,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:10,773 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:10,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:14:10,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1606288593, now seen corresponding path program 1 times [2025-03-17 10:14:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:10,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304857984] [2025-03-17 10:14:10,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 10:14:11,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 10:14:11,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:11,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:11,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304857984] [2025-03-17 10:14:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304857984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:11,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138020850] [2025-03-17 10:14:11,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:11,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:11,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:11,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:11,701 INFO L87 Difference]: Start difference. First operand 972 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-17 10:14:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:11,840 INFO L93 Difference]: Finished difference Result 972 states and 1275 transitions. [2025-03-17 10:14:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:11,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 121 [2025-03-17 10:14:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:11,845 INFO L225 Difference]: With dead ends: 972 [2025-03-17 10:14:11,846 INFO L226 Difference]: Without dead ends: 970 [2025-03-17 10:14:11,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:11,847 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 1238 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 2521 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:11,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 2521 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-03-17 10:14:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2025-03-17 10:14:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 615 states have (on average 1.2308943089430895) internal successors, (757), 652 states have internal predecessors, (757), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1273 transitions. [2025-03-17 10:14:11,900 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1273 transitions. Word has length 121 [2025-03-17 10:14:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:11,900 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1273 transitions. [2025-03-17 10:14:11,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-17 10:14:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1273 transitions. [2025-03-17 10:14:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 10:14:11,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:11,902 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:14:11,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash -134917885, now seen corresponding path program 1 times [2025-03-17 10:14:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:11,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768434687] [2025-03-17 10:14:11,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:12,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 10:14:12,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 10:14:12,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:12,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:12,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768434687] [2025-03-17 10:14:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768434687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518631258] [2025-03-17 10:14:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:12,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:12,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:12,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:12,628 INFO L87 Difference]: Start difference. First operand 970 states and 1273 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:12,736 INFO L93 Difference]: Finished difference Result 1902 states and 2499 transitions. [2025-03-17 10:14:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-17 10:14:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:12,742 INFO L225 Difference]: With dead ends: 1902 [2025-03-17 10:14:12,742 INFO L226 Difference]: Without dead ends: 966 [2025-03-17 10:14:12,745 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-03-17 10:14:12,746 INFO L435 NwaCegarLoop]: 1257 mSDtfsCounter, 1232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:12,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 1257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-17 10:14:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2025-03-17 10:14:12,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 612 states have (on average 1.2287581699346406) internal successors, (752), 648 states have internal predecessors, (752), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:12,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1268 transitions. [2025-03-17 10:14:12,857 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1268 transitions. Word has length 166 [2025-03-17 10:14:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1268 transitions. [2025-03-17 10:14:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:14:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1268 transitions. [2025-03-17 10:14:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 10:14:12,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:12,860 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:12,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:14:12,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:12,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1115292283, now seen corresponding path program 1 times [2025-03-17 10:14:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057778121] [2025-03-17 10:14:12,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:13,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 10:14:13,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 10:14:13,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:13,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057778121] [2025-03-17 10:14:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057778121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:13,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964222804] [2025-03-17 10:14:13,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:13,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:13,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:13,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:13,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:13,751 INFO L87 Difference]: Start difference. First operand 966 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-03-17 10:14:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:13,910 INFO L93 Difference]: Finished difference Result 966 states and 1268 transitions. [2025-03-17 10:14:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 127 [2025-03-17 10:14:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:13,916 INFO L225 Difference]: With dead ends: 966 [2025-03-17 10:14:13,916 INFO L226 Difference]: Without dead ends: 964 [2025-03-17 10:14:13,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:13,918 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 1230 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:13,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 2507 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-17 10:14:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2025-03-17 10:14:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 611 states have (on average 1.227495908346972) internal successors, (750), 646 states have internal predecessors, (750), 259 states have call successors, (259), 79 states have call predecessors, (259), 78 states have return successors, (257), 247 states have call predecessors, (257), 257 states have call successors, (257) [2025-03-17 10:14:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1266 transitions. [2025-03-17 10:14:13,980 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1266 transitions. Word has length 127 [2025-03-17 10:14:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:13,981 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1266 transitions. [2025-03-17 10:14:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-03-17 10:14:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1266 transitions. [2025-03-17 10:14:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 10:14:13,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:13,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:13,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:14:13,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 152997044, now seen corresponding path program 1 times [2025-03-17 10:14:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:13,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818703084] [2025-03-17 10:14:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:14,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 10:14:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 10:14:14,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:14,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 10:14:14,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:14,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818703084] [2025-03-17 10:14:14,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818703084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:14,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:14,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:14:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392652162] [2025-03-17 10:14:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:14:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:15,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:14:15,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:15,002 INFO L87 Difference]: Start difference. First operand 964 states and 1266 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 10:14:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:15,233 INFO L93 Difference]: Finished difference Result 1662 states and 2141 transitions. [2025-03-17 10:14:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:14:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2025-03-17 10:14:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:15,240 INFO L225 Difference]: With dead ends: 1662 [2025-03-17 10:14:15,241 INFO L226 Difference]: Without dead ends: 969 [2025-03-17 10:14:15,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:14:15,243 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 0 mSDsluCounter, 5005 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6258 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:15,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6258 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-03-17 10:14:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2025-03-17 10:14:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 615 states have (on average 1.2260162601626017) internal successors, (754), 650 states have internal predecessors, (754), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-03-17 10:14:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1274 transitions. [2025-03-17 10:14:15,365 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1274 transitions. Word has length 160 [2025-03-17 10:14:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:15,365 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1274 transitions. [2025-03-17 10:14:15,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 10:14:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1274 transitions. [2025-03-17 10:14:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 10:14:15,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:15,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:15,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:14:15,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:15,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2140631718, now seen corresponding path program 1 times [2025-03-17 10:14:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080301589] [2025-03-17 10:14:15,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:16,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 10:14:16,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 10:14:16,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:16,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080301589] [2025-03-17 10:14:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080301589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:16,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246343512] [2025-03-17 10:14:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:16,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:16,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:16,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:16,361 INFO L87 Difference]: Start difference. First operand 969 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:14:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:16,520 INFO L93 Difference]: Finished difference Result 969 states and 1274 transitions. [2025-03-17 10:14:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:16,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-03-17 10:14:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:16,533 INFO L225 Difference]: With dead ends: 969 [2025-03-17 10:14:16,534 INFO L226 Difference]: Without dead ends: 967 [2025-03-17 10:14:16,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:16,535 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1227 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:16,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2503 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-03-17 10:14:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2025-03-17 10:14:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 614 states have (on average 1.224755700325733) internal successors, (752), 648 states have internal predecessors, (752), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-03-17 10:14:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1272 transitions. [2025-03-17 10:14:16,597 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1272 transitions. Word has length 133 [2025-03-17 10:14:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1272 transitions. [2025-03-17 10:14:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:14:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1272 transitions. [2025-03-17 10:14:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 10:14:16,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:16,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:16,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:14:16,600 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -717547059, now seen corresponding path program 1 times [2025-03-17 10:14:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648455489] [2025-03-17 10:14:16,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:17,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 10:14:17,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 10:14:17,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:17,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:17,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648455489] [2025-03-17 10:14:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648455489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:17,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:17,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:17,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301454420] [2025-03-17 10:14:17,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:17,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:17,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:17,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:17,312 INFO L87 Difference]: Start difference. First operand 967 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:14:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:17,492 INFO L93 Difference]: Finished difference Result 967 states and 1272 transitions. [2025-03-17 10:14:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2025-03-17 10:14:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:17,501 INFO L225 Difference]: With dead ends: 967 [2025-03-17 10:14:17,502 INFO L226 Difference]: Without dead ends: 965 [2025-03-17 10:14:17,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:17,503 INFO L435 NwaCegarLoop]: 1250 mSDtfsCounter, 1224 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:17,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2499 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-03-17 10:14:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2025-03-17 10:14:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 613 states have (on average 1.2234910277324633) internal successors, (750), 646 states have internal predecessors, (750), 259 states have call successors, (259), 79 states have call predecessors, (259), 79 states have return successors, (261), 248 states have call predecessors, (261), 257 states have call successors, (261) [2025-03-17 10:14:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1270 transitions. [2025-03-17 10:14:17,557 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1270 transitions. Word has length 139 [2025-03-17 10:14:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1270 transitions. [2025-03-17 10:14:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:14:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1270 transitions. [2025-03-17 10:14:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 10:14:17,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:17,560 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:17,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:14:17,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:17,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1683443879, now seen corresponding path program 1 times [2025-03-17 10:14:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860083247] [2025-03-17 10:14:17,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:17,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:18,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 10:14:18,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 10:14:18,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:18,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-17 10:14:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860083247] [2025-03-17 10:14:18,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860083247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:18,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835618941] [2025-03-17 10:14:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:18,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:18,490 INFO L87 Difference]: Start difference. First operand 965 states and 1270 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:18,757 INFO L93 Difference]: Finished difference Result 1069 states and 1373 transitions. [2025-03-17 10:14:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 176 [2025-03-17 10:14:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:18,763 INFO L225 Difference]: With dead ends: 1069 [2025-03-17 10:14:18,763 INFO L226 Difference]: Without dead ends: 1067 [2025-03-17 10:14:18,764 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-03-17 10:14:18,764 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 1123 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:18,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 4042 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-03-17 10:14:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1061. [2025-03-17 10:14:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 677 states have (on average 1.2171344165435747) internal successors, (824), 710 states have internal predecessors, (824), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-03-17 10:14:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1368 transitions. [2025-03-17 10:14:18,836 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1368 transitions. Word has length 176 [2025-03-17 10:14:18,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:18,837 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1368 transitions. [2025-03-17 10:14:18,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1368 transitions. [2025-03-17 10:14:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 10:14:18,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:18,839 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:18,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:14:18,840 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:18,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2070022965, now seen corresponding path program 1 times [2025-03-17 10:14:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:18,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880014425] [2025-03-17 10:14:18,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 10:14:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 10:14:19,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:19,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880014425] [2025-03-17 10:14:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880014425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320272367] [2025-03-17 10:14:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:19,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:19,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:19,693 INFO L87 Difference]: Start difference. First operand 1061 states and 1368 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:19,846 INFO L93 Difference]: Finished difference Result 1061 states and 1368 transitions. [2025-03-17 10:14:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-03-17 10:14:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:19,851 INFO L225 Difference]: With dead ends: 1061 [2025-03-17 10:14:19,851 INFO L226 Difference]: Without dead ends: 1059 [2025-03-17 10:14:19,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:19,852 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 1221 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:19,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 2495 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-03-17 10:14:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2025-03-17 10:14:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 676 states have (on average 1.2159763313609468) internal successors, (822), 708 states have internal predecessors, (822), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-03-17 10:14:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1366 transitions. [2025-03-17 10:14:19,924 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1366 transitions. Word has length 145 [2025-03-17 10:14:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:19,925 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1366 transitions. [2025-03-17 10:14:19,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1366 transitions. [2025-03-17 10:14:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 10:14:19,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:19,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:19,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:14:19,927 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -156534453, now seen corresponding path program 1 times [2025-03-17 10:14:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371736171] [2025-03-17 10:14:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:20,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 10:14:20,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 10:14:20,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:20,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:20,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371736171] [2025-03-17 10:14:20,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371736171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:20,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:20,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002949076] [2025-03-17 10:14:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:20,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:20,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:20,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:20,749 INFO L87 Difference]: Start difference. First operand 1059 states and 1366 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:20,938 INFO L93 Difference]: Finished difference Result 1059 states and 1366 transitions. [2025-03-17 10:14:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2025-03-17 10:14:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:20,943 INFO L225 Difference]: With dead ends: 1059 [2025-03-17 10:14:20,943 INFO L226 Difference]: Without dead ends: 1057 [2025-03-17 10:14:20,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:20,945 INFO L435 NwaCegarLoop]: 1246 mSDtfsCounter, 1218 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:20,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 2491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2025-03-17 10:14:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1057. [2025-03-17 10:14:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 675 states have (on average 1.2148148148148148) internal successors, (820), 706 states have internal predecessors, (820), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-03-17 10:14:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1364 transitions. [2025-03-17 10:14:21,023 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1364 transitions. Word has length 151 [2025-03-17 10:14:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:21,023 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1364 transitions. [2025-03-17 10:14:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1364 transitions. [2025-03-17 10:14:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-17 10:14:21,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:21,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:21,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:14:21,026 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2059883368, now seen corresponding path program 1 times [2025-03-17 10:14:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118770984] [2025-03-17 10:14:21,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 10:14:21,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 10:14:21,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:21,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-03-17 10:14:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:21,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118770984] [2025-03-17 10:14:21,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118770984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:21,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:21,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:14:21,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909173678] [2025-03-17 10:14:21,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:21,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:21,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:21,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:14:21,712 INFO L87 Difference]: Start difference. First operand 1057 states and 1364 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:21,853 INFO L93 Difference]: Finished difference Result 1972 states and 2515 transitions. [2025-03-17 10:14:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-03-17 10:14:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:21,859 INFO L225 Difference]: With dead ends: 1972 [2025-03-17 10:14:21,859 INFO L226 Difference]: Without dead ends: 1053 [2025-03-17 10:14:21,861 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-03-17 10:14:21,864 INFO L435 NwaCegarLoop]: 1242 mSDtfsCounter, 1241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:21,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1242 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-17 10:14:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2025-03-17 10:14:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 672 states have (on average 1.212797619047619) internal successors, (815), 702 states have internal predecessors, (815), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-03-17 10:14:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1359 transitions. [2025-03-17 10:14:21,941 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1359 transitions. Word has length 197 [2025-03-17 10:14:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1359 transitions. [2025-03-17 10:14:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 10:14:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1359 transitions. [2025-03-17 10:14:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 10:14:21,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:21,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:21,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:14:21,943 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:21,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:21,944 INFO L85 PathProgramCache]: Analyzing trace with hash -514315471, now seen corresponding path program 1 times [2025-03-17 10:14:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887447890] [2025-03-17 10:14:21,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 10:14:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 10:14:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887447890] [2025-03-17 10:14:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887447890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488250602] [2025-03-17 10:14:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:22,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:22,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:22,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:22,765 INFO L87 Difference]: Start difference. First operand 1053 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 10:14:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:22,977 INFO L93 Difference]: Finished difference Result 1053 states and 1359 transitions. [2025-03-17 10:14:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:22,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2025-03-17 10:14:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:22,982 INFO L225 Difference]: With dead ends: 1053 [2025-03-17 10:14:22,982 INFO L226 Difference]: Without dead ends: 1051 [2025-03-17 10:14:22,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:22,983 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 1210 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:22,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 2477 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-17 10:14:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-03-17 10:14:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 671 states have (on average 1.2116244411326378) internal successors, (813), 700 states have internal predecessors, (813), 271 states have call successors, (271), 99 states have call predecessors, (271), 99 states have return successors, (273), 260 states have call predecessors, (273), 269 states have call successors, (273) [2025-03-17 10:14:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1357 transitions. [2025-03-17 10:14:23,064 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1357 transitions. Word has length 157 [2025-03-17 10:14:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1357 transitions. [2025-03-17 10:14:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-17 10:14:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1357 transitions. [2025-03-17 10:14:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 10:14:23,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:23,066 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:23,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:14:23,066 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:23,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash 390527079, now seen corresponding path program 1 times [2025-03-17 10:14:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925232773] [2025-03-17 10:14:23,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 10:14:23,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 10:14:23,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-17 10:14:23,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925232773] [2025-03-17 10:14:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925232773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:14:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621690156] [2025-03-17 10:14:23,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:23,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:14:23,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:23,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:14:23,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:14:25,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 10:14:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 10:14:25,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:25,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:25,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 2407 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 10:14:25,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:14:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-17 10:14:25,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:14:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621690156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:14:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-17 10:14:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918413931] [2025-03-17 10:14:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:14:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:14:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:25,439 INFO L87 Difference]: Start difference. First operand 1051 states and 1357 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:25,601 INFO L93 Difference]: Finished difference Result 2011 states and 2565 transitions. [2025-03-17 10:14:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:14:25,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 203 [2025-03-17 10:14:25,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:25,607 INFO L225 Difference]: With dead ends: 2011 [2025-03-17 10:14:25,607 INFO L226 Difference]: Without dead ends: 1101 [2025-03-17 10:14:25,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:14:25,610 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1184 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1363 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-03-17 10:14:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1098. [2025-03-17 10:14:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 698 states have (on average 1.2048710601719197) internal successors, (841), 730 states have internal predecessors, (841), 286 states have call successors, (286), 105 states have call predecessors, (286), 105 states have return successors, (288), 273 states have call predecessors, (288), 284 states have call successors, (288) [2025-03-17 10:14:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1415 transitions. [2025-03-17 10:14:25,691 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1415 transitions. Word has length 203 [2025-03-17 10:14:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:25,692 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1415 transitions. [2025-03-17 10:14:25,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 10:14:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1415 transitions. [2025-03-17 10:14:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 10:14:25,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:25,694 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:25,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:14:25,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 10:14:25,895 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:25,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1163589262, now seen corresponding path program 1 times [2025-03-17 10:14:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673106738] [2025-03-17 10:14:25,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:26,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 10:14:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 10:14:26,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-17 10:14:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673106738] [2025-03-17 10:14:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673106738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363350545] [2025-03-17 10:14:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:26,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:26,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:26,793 INFO L87 Difference]: Start difference. First operand 1098 states and 1415 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:30,813 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-03-17 10:14:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:31,080 INFO L93 Difference]: Finished difference Result 1110 states and 1423 transitions. [2025-03-17 10:14:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 194 [2025-03-17 10:14:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:31,085 INFO L225 Difference]: With dead ends: 1110 [2025-03-17 10:14:31,085 INFO L226 Difference]: Without dead ends: 1108 [2025-03-17 10:14:31,086 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-03-17 10:14:31,086 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 192 mSDsluCounter, 3728 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 5026 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:31,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 5026 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 10:14:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-17 10:14:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1102. [2025-03-17 10:14:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 701 states have (on average 1.2039942938659058) internal successors, (844), 733 states have internal predecessors, (844), 286 states have call successors, (286), 106 states have call predecessors, (286), 106 states have return successors, (288), 273 states have call predecessors, (288), 284 states have call successors, (288) [2025-03-17 10:14:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1418 transitions. [2025-03-17 10:14:31,170 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1418 transitions. Word has length 194 [2025-03-17 10:14:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1418 transitions. [2025-03-17 10:14:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1418 transitions. [2025-03-17 10:14:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 10:14:31,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:31,174 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:14:31,174 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1234475827, now seen corresponding path program 1 times [2025-03-17 10:14:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722413713] [2025-03-17 10:14:31,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:31,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 10:14:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 10:14:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-17 10:14:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:32,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722413713] [2025-03-17 10:14:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722413713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:32,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:32,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:14:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789712100] [2025-03-17 10:14:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:14:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:14:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:32,161 INFO L87 Difference]: Start difference. First operand 1102 states and 1418 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:32,576 INFO L93 Difference]: Finished difference Result 1805 states and 2287 transitions. [2025-03-17 10:14:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:14:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 194 [2025-03-17 10:14:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:32,584 INFO L225 Difference]: With dead ends: 1805 [2025-03-17 10:14:32,585 INFO L226 Difference]: Without dead ends: 1803 [2025-03-17 10:14:32,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03-17 10:14:32,586 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 1177 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 5580 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:32,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 5580 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:14:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-17 10:14:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1741. [2025-03-17 10:14:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1133 states have (on average 1.2100617828773168) internal successors, (1371), 1181 states have internal predecessors, (1371), 421 states have call successors, (421), 177 states have call predecessors, (421), 178 states have return successors, (429), 395 states have call predecessors, (429), 419 states have call successors, (429) [2025-03-17 10:14:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2221 transitions. [2025-03-17 10:14:32,723 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2221 transitions. Word has length 194 [2025-03-17 10:14:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:32,723 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2221 transitions. [2025-03-17 10:14:32,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2221 transitions. [2025-03-17 10:14:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 10:14:32,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:32,725 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:32,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 10:14:32,725 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:32,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash 637522529, now seen corresponding path program 1 times [2025-03-17 10:14:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155902325] [2025-03-17 10:14:32,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:32,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:33,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 10:14:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 10:14:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:33,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:33,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155902325] [2025-03-17 10:14:33,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155902325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:33,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:33,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:33,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550125260] [2025-03-17 10:14:33,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:33,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:33,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:33,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:33,443 INFO L87 Difference]: Start difference. First operand 1741 states and 2221 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:33,643 INFO L93 Difference]: Finished difference Result 1741 states and 2221 transitions. [2025-03-17 10:14:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-03-17 10:14:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:33,654 INFO L225 Difference]: With dead ends: 1741 [2025-03-17 10:14:33,657 INFO L226 Difference]: Without dead ends: 1739 [2025-03-17 10:14:33,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:33,658 INFO L435 NwaCegarLoop]: 1232 mSDtfsCounter, 1202 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:33,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 2463 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-03-17 10:14:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1739. [2025-03-17 10:14:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1132 states have (on average 1.2084805653710247) internal successors, (1368), 1179 states have internal predecessors, (1368), 421 states have call successors, (421), 177 states have call predecessors, (421), 178 states have return successors, (429), 395 states have call predecessors, (429), 419 states have call successors, (429) [2025-03-17 10:14:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2218 transitions. [2025-03-17 10:14:33,797 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2218 transitions. Word has length 163 [2025-03-17 10:14:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:33,797 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2218 transitions. [2025-03-17 10:14:33,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 10:14:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2218 transitions. [2025-03-17 10:14:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 10:14:33,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:33,800 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:33,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 10:14:33,800 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:33,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1902372744, now seen corresponding path program 1 times [2025-03-17 10:14:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028418504] [2025-03-17 10:14:33,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:34,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 10:14:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 10:14:34,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:34,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028418504] [2025-03-17 10:14:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028418504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:34,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268695538] [2025-03-17 10:14:34,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:34,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:34,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:34,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:34,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:34,504 INFO L87 Difference]: Start difference. First operand 1739 states and 2218 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:34,705 INFO L93 Difference]: Finished difference Result 1739 states and 2218 transitions. [2025-03-17 10:14:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:34,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 169 [2025-03-17 10:14:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:34,713 INFO L225 Difference]: With dead ends: 1739 [2025-03-17 10:14:34,713 INFO L226 Difference]: Without dead ends: 1737 [2025-03-17 10:14:34,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:34,714 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 1199 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:34,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 2459 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-03-17 10:14:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1737. [2025-03-17 10:14:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1131 states have (on average 1.206896551724138) internal successors, (1365), 1177 states have internal predecessors, (1365), 421 states have call successors, (421), 177 states have call predecessors, (421), 178 states have return successors, (429), 395 states have call predecessors, (429), 419 states have call successors, (429) [2025-03-17 10:14:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2215 transitions. [2025-03-17 10:14:34,942 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2215 transitions. Word has length 169 [2025-03-17 10:14:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:34,943 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2215 transitions. [2025-03-17 10:14:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 10:14:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2215 transitions. [2025-03-17 10:14:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-17 10:14:34,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:34,946 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:34,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 10:14:34,946 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash -402961756, now seen corresponding path program 1 times [2025-03-17 10:14:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188367929] [2025-03-17 10:14:34,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:35,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-17 10:14:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-17 10:14:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-17 10:14:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188367929] [2025-03-17 10:14:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188367929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:14:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455955339] [2025-03-17 10:14:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:14:36,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:14:36,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:14:36,368 INFO L87 Difference]: Start difference. First operand 1737 states and 2215 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:14:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:37,010 INFO L93 Difference]: Finished difference Result 3393 states and 4321 transitions. [2025-03-17 10:14:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:14:37,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 3 states have call successors, (26) Word has length 217 [2025-03-17 10:14:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:37,017 INFO L225 Difference]: With dead ends: 3393 [2025-03-17 10:14:37,017 INFO L226 Difference]: Without dead ends: 1744 [2025-03-17 10:14:37,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:14:37,021 INFO L435 NwaCegarLoop]: 1230 mSDtfsCounter, 0 mSDsluCounter, 7357 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8587 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:37,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8587 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:14:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-03-17 10:14:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1744. [2025-03-17 10:14:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1136 states have (on average 1.2059859154929577) internal successors, (1370), 1181 states have internal predecessors, (1370), 422 states have call successors, (422), 177 states have call predecessors, (422), 179 states have return successors, (434), 398 states have call predecessors, (434), 420 states have call successors, (434) [2025-03-17 10:14:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2226 transitions. [2025-03-17 10:14:37,166 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2226 transitions. Word has length 217 [2025-03-17 10:14:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2226 transitions. [2025-03-17 10:14:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 5 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-17 10:14:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2226 transitions. [2025-03-17 10:14:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 10:14:37,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:37,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:37,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 10:14:37,170 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:37,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 616289651, now seen corresponding path program 1 times [2025-03-17 10:14:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:37,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724706192] [2025-03-17 10:14:37,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 10:14:37,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 10:14:37,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:37,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724706192] [2025-03-17 10:14:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724706192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932936053] [2025-03-17 10:14:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:37,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:37,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:37,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:37,935 INFO L87 Difference]: Start difference. First operand 1744 states and 2226 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:38,121 INFO L93 Difference]: Finished difference Result 1744 states and 2226 transitions. [2025-03-17 10:14:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-03-17 10:14:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:38,128 INFO L225 Difference]: With dead ends: 1744 [2025-03-17 10:14:38,128 INFO L226 Difference]: Without dead ends: 1742 [2025-03-17 10:14:38,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:38,130 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 1196 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:38,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 2455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:14:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-17 10:14:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2025-03-17 10:14:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1135 states have (on average 1.2044052863436123) internal successors, (1367), 1179 states have internal predecessors, (1367), 422 states have call successors, (422), 177 states have call predecessors, (422), 179 states have return successors, (434), 398 states have call predecessors, (434), 420 states have call successors, (434) [2025-03-17 10:14:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2223 transitions. [2025-03-17 10:14:38,276 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2223 transitions. Word has length 175 [2025-03-17 10:14:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:38,276 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2223 transitions. [2025-03-17 10:14:38,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 10:14:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2223 transitions. [2025-03-17 10:14:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-17 10:14:38,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:38,279 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:38,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 10:14:38,279 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:38,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1689844567, now seen corresponding path program 1 times [2025-03-17 10:14:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:38,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137424961] [2025-03-17 10:14:38,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:38,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-17 10:14:38,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-17 10:14:38,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:38,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-03-17 10:14:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137424961] [2025-03-17 10:14:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137424961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:40,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 10:14:40,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445291026] [2025-03-17 10:14:40,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:14:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:40,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:14:40,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:14:40,593 INFO L87 Difference]: Start difference. First operand 1742 states and 2223 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (29), 7 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-17 10:14:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:42,567 INFO L93 Difference]: Finished difference Result 3321 states and 4208 transitions. [2025-03-17 10:14:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 10:14:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (29), 7 states have call predecessors, (29), 5 states have call successors, (29) Word has length 233 [2025-03-17 10:14:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:42,577 INFO L225 Difference]: With dead ends: 3321 [2025-03-17 10:14:42,577 INFO L226 Difference]: Without dead ends: 1772 [2025-03-17 10:14:42,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:14:42,584 INFO L435 NwaCegarLoop]: 1195 mSDtfsCounter, 136 mSDsluCounter, 13041 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 14236 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:42,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 14236 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 10:14:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-17 10:14:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1760. [2025-03-17 10:14:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1144 states have (on average 1.2027972027972027) internal successors, (1376), 1189 states have internal predecessors, (1376), 429 states have call successors, (429), 178 states have call predecessors, (429), 181 states have return successors, (442), 405 states have call predecessors, (442), 427 states have call successors, (442) [2025-03-17 10:14:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2247 transitions. [2025-03-17 10:14:42,747 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2247 transitions. Word has length 233 [2025-03-17 10:14:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2247 transitions. [2025-03-17 10:14:42,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (29), 7 states have call predecessors, (29), 5 states have call successors, (29) [2025-03-17 10:14:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2247 transitions. [2025-03-17 10:14:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 10:14:42,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:42,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:14:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 10:14:42,751 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 55767505, now seen corresponding path program 1 times [2025-03-17 10:14:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312495432] [2025-03-17 10:14:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:43,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 10:14:43,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 10:14:43,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 10:14:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:43,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312495432] [2025-03-17 10:14:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312495432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:14:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:14:43,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689087945] [2025-03-17 10:14:43,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:43,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:14:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:14:43,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:14:43,522 INFO L87 Difference]: Start difference. First operand 1760 states and 2247 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 10:14:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:43,931 INFO L93 Difference]: Finished difference Result 3401 states and 4335 transitions. [2025-03-17 10:14:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:14:43,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2025-03-17 10:14:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:43,941 INFO L225 Difference]: With dead ends: 3401 [2025-03-17 10:14:43,941 INFO L226 Difference]: Without dead ends: 3132 [2025-03-17 10:14:43,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:14:43,943 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 1191 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:43,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 3715 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:14:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2025-03-17 10:14:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3113. [2025-03-17 10:14:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3113 states, 2039 states have (on average 1.217263364394311) internal successors, (2482), 2111 states have internal predecessors, (2482), 752 states have call successors, (752), 310 states have call predecessors, (752), 316 states have return successors, (788), 712 states have call predecessors, (788), 750 states have call successors, (788) [2025-03-17 10:14:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4022 transitions. [2025-03-17 10:14:44,211 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4022 transitions. Word has length 181 [2025-03-17 10:14:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:44,212 INFO L471 AbstractCegarLoop]: Abstraction has 3113 states and 4022 transitions. [2025-03-17 10:14:44,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-17 10:14:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4022 transitions. [2025-03-17 10:14:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 10:14:44,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:44,214 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 10:14:44,214 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1954476078, now seen corresponding path program 1 times [2025-03-17 10:14:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974807883] [2025-03-17 10:14:44,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:14:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:14:44,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-03-17 10:14:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974807883] [2025-03-17 10:14:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974807883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:14:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331348984] [2025-03-17 10:14:45,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:45,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:14:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:45,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:14:45,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:14:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:14:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:14:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:46,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:46,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:14:46,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:14:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-17 10:14:47,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:14:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331348984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:14:47,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:14:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-17 10:14:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957659331] [2025-03-17 10:14:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:14:47,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:14:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:14:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:14:47,031 INFO L87 Difference]: Start difference. First operand 3113 states and 4022 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-17 10:14:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:14:47,969 INFO L93 Difference]: Finished difference Result 6153 states and 7940 transitions. [2025-03-17 10:14:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:14:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 237 [2025-03-17 10:14:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:14:47,983 INFO L225 Difference]: With dead ends: 6153 [2025-03-17 10:14:47,983 INFO L226 Difference]: Without dead ends: 3081 [2025-03-17 10:14:47,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:14:47,991 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 2 mSDsluCounter, 4786 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5994 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:14:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5994 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:14:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2025-03-17 10:14:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3081. [2025-03-17 10:14:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2022 states have (on average 1.2176063303659743) internal successors, (2462), 2091 states have internal predecessors, (2462), 740 states have call successors, (740), 307 states have call predecessors, (740), 313 states have return successors, (776), 701 states have call predecessors, (776), 738 states have call successors, (776) [2025-03-17 10:14:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3978 transitions. [2025-03-17 10:14:48,261 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3978 transitions. Word has length 237 [2025-03-17 10:14:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:14:48,261 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 3978 transitions. [2025-03-17 10:14:48,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-17 10:14:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3978 transitions. [2025-03-17 10:14:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 10:14:48,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:14:48,263 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:14:48,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:14:48,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-17 10:14:48,464 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2025-03-17 10:14:48,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:14:48,465 INFO L85 PathProgramCache]: Analyzing trace with hash -867516528, now seen corresponding path program 1 times [2025-03-17 10:14:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:14:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134204770] [2025-03-17 10:14:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:14:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:14:49,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:14:49,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:49,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-17 10:14:50,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:14:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134204770] [2025-03-17 10:14:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134204770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:14:50,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673905798] [2025-03-17 10:14:50,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:14:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:14:50,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:50,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:14:50,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:14:51,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-17 10:14:51,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-17 10:14:51,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:14:51,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:14:51,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 10:14:51,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:14:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 219 proven. 3 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-17 10:14:52,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:14:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-17 10:14:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673905798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:14:53,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:14:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 14 [2025-03-17 10:14:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576968982] [2025-03-17 10:14:53,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:14:53,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:14:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:14:53,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:14:53,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:14:53,092 INFO L87 Difference]: Start difference. First operand 3081 states and 3978 transitions. Second operand has 14 states, 13 states have (on average 11.384615384615385) internal successors, (148), 12 states have internal predecessors, (148), 5 states have call successors, (60), 2 states have call predecessors, (60), 5 states have return successors, (60), 6 states have call predecessors, (60), 5 states have call successors, (60)