./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:26:11,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:26:11,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 08:26:11,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:26:11,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:26:11,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:26:11,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:26:11,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:26:11,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:26:11,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:26:11,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:26:11,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:26:11,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:26:11,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:11,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:26:11,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:26:11,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:26:11,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:26:11,838 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2025-02-06 08:26:12,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:26:12,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:26:12,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:26:12,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:26:12,098 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:26:12,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-02-06 08:26:13,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba0674c2/f9b8a1011b8f4104853020420bf34b9d/FLAG1dac68fe5 [2025-02-06 08:26:13,742 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:26:13,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-02-06 08:26:13,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba0674c2/f9b8a1011b8f4104853020420bf34b9d/FLAG1dac68fe5 [2025-02-06 08:26:13,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ba0674c2/f9b8a1011b8f4104853020420bf34b9d [2025-02-06 08:26:13,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:26:13,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:26:13,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:13,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:26:13,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:26:13,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:13" (1/1) ... [2025-02-06 08:26:13,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add3508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:13, skipping insertion in model container [2025-02-06 08:26:13,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:26:13" (1/1) ... [2025-02-06 08:26:13,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:26:15,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-02-06 08:26:15,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-02-06 08:26:15,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-02-06 08:26:15,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-02-06 08:26:15,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-02-06 08:26:15,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-02-06 08:26:15,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-02-06 08:26:15,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-02-06 08:26:15,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-02-06 08:26:15,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-02-06 08:26:15,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-02-06 08:26:15,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-02-06 08:26:15,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-02-06 08:26:15,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-02-06 08:26:15,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-02-06 08:26:15,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-02-06 08:26:15,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-02-06 08:26:15,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-02-06 08:26:15,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-02-06 08:26:15,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-02-06 08:26:15,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-02-06 08:26:15,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-02-06 08:26:15,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-02-06 08:26:15,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-02-06 08:26:15,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-02-06 08:26:15,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-02-06 08:26:15,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-02-06 08:26:15,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-02-06 08:26:15,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-02-06 08:26:15,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-02-06 08:26:15,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-02-06 08:26:15,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-02-06 08:26:15,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-02-06 08:26:15,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-02-06 08:26:15,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-02-06 08:26:15,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-02-06 08:26:15,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-02-06 08:26:15,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-02-06 08:26:15,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-02-06 08:26:15,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-02-06 08:26:15,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-02-06 08:26:15,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-02-06 08:26:15,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-02-06 08:26:15,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-02-06 08:26:15,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-02-06 08:26:15,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-02-06 08:26:15,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-02-06 08:26:15,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-02-06 08:26:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-02-06 08:26:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-02-06 08:26:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-02-06 08:26:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-02-06 08:26:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-02-06 08:26:15,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-02-06 08:26:15,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-02-06 08:26:15,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-02-06 08:26:15,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-02-06 08:26:15,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-02-06 08:26:15,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-02-06 08:26:15,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-02-06 08:26:15,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-02-06 08:26:15,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-02-06 08:26:15,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-02-06 08:26:15,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-02-06 08:26:15,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-02-06 08:26:15,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-02-06 08:26:15,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-02-06 08:26:15,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-02-06 08:26:15,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-02-06 08:26:15,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-02-06 08:26:15,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-02-06 08:26:15,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-02-06 08:26:15,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-02-06 08:26:15,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-02-06 08:26:15,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-02-06 08:26:15,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-02-06 08:26:15,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-02-06 08:26:15,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-02-06 08:26:15,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-02-06 08:26:15,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-02-06 08:26:15,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-02-06 08:26:15,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-02-06 08:26:15,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-02-06 08:26:15,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-02-06 08:26:15,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-02-06 08:26:15,366 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-02-06 08:26:15,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-02-06 08:26:15,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-02-06 08:26:15,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:15,398 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:26:15,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4644] [2025-02-06 08:26:15,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [4799] [2025-02-06 08:26:15,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("sfence": : : "memory"); [5192] [2025-02-06 08:26:15,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2025-02-06 08:26:15,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2025-02-06 08:26:15,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2025-02-06 08:26:15,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2025-02-06 08:26:15,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2025-02-06 08:26:15,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2025-02-06 08:26:15,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2025-02-06 08:26:15,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2025-02-06 08:26:15,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2025-02-06 08:26:15,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2025-02-06 08:26:15,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2025-02-06 08:26:15,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2025-02-06 08:26:15,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2025-02-06 08:26:15,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2025-02-06 08:26:15,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2025-02-06 08:26:15,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2025-02-06 08:26:15,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2025-02-06 08:26:15,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2025-02-06 08:26:15,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2025-02-06 08:26:15,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2025-02-06 08:26:15,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2025-02-06 08:26:15,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2025-02-06 08:26:15,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2025-02-06 08:26:15,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2025-02-06 08:26:15,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2025-02-06 08:26:15,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2025-02-06 08:26:15,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2025-02-06 08:26:15,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2025-02-06 08:26:15,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2025-02-06 08:26:15,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2025-02-06 08:26:15,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2025-02-06 08:26:15,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2025-02-06 08:26:15,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2025-02-06 08:26:15,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2025-02-06 08:26:15,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2025-02-06 08:26:15,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2025-02-06 08:26:15,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2025-02-06 08:26:15,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2025-02-06 08:26:15,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2025-02-06 08:26:15,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2025-02-06 08:26:15,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2025-02-06 08:26:15,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2025-02-06 08:26:15,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2025-02-06 08:26:15,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2025-02-06 08:26:15,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2025-02-06 08:26:15,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2025-02-06 08:26:15,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2025-02-06 08:26:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2025-02-06 08:26:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2025-02-06 08:26:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2025-02-06 08:26:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2025-02-06 08:26:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2025-02-06 08:26:15,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2025-02-06 08:26:15,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2025-02-06 08:26:15,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:26:15,742 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:26:15,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15 WrapperNode [2025-02-06 08:26:15,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:26:15,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:15,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:26:15,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:26:15,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:15,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:15,916 INFO L138 Inliner]: procedures = 526, calls = 1370, calls flagged for inlining = 224, calls inlined = 135, statements flattened = 2492 [2025-02-06 08:26:15,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:26:15,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:26:15,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:26:15,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:26:15,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:15,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:15,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,166 INFO L175 MemorySlicer]: Split 355 memory accesses to 11 slices as follows [7, 1, 2, 23, 5, 4, 277, 3, 28, 3, 2]. 78 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [7, 1, 2, 0, 0, 4, 26, 0, 0, 0, 0]. The 184 writes are split as follows [0, 0, 0, 23, 5, 0, 132, 0, 24, 0, 0]. [2025-02-06 08:26:16,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:26:16,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:26:16,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:26:16,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:26:16,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (1/1) ... [2025-02-06 08:26:16,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:26:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:26:16,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:26:16,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:26:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-02-06 08:26:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 08:26:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 08:26:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-02-06 08:26:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-02-06 08:26:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-02-06 08:26:16,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:26:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-02-06 08:26:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-02-06 08:26:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-02-06 08:26:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-02-06 08:26:16,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2025-02-06 08:26:16,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 08:26:16,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-02-06 08:26:16,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 08:26:16,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 08:26:16,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-02-06 08:26:16,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-02-06 08:26:16,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-02-06 08:26:16,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:26:16,335 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-02-06 08:26:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-02-06 08:26:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-02-06 08:26:16,336 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 08:26:16,336 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2025-02-06 08:26:16,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:16,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2025-02-06 08:26:16,338 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 08:26:16,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2025-02-06 08:26:16,341 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2025-02-06 08:26:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2025-02-06 08:26:16,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2025-02-06 08:26:16,737 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:26:16,740 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:26:16,769 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4347: havoc dev_get_drvdata_#t~mem60#1.base, dev_get_drvdata_#t~mem60#1.offset; [2025-02-06 08:26:16,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 08:26:16,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4446: havoc #t~mem93;havoc #t~bitwise94; [2025-02-06 08:26:16,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4259: havoc #t~mem42; [2025-02-06 08:26:16,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11215: havoc #t~nondet552; [2025-02-06 08:26:17,073 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11175: havoc #t~nondet550; [2025-02-06 08:26:17,078 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11230: havoc #t~nondet555; [2025-02-06 08:26:17,123 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11219: havoc #t~nondet553; [2025-02-06 08:26:17,185 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11226: havoc #t~nondet554; [2025-02-06 08:26:17,191 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11171: havoc #t~nondet549; [2025-02-06 08:26:22,132 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4335: havoc dev_name_#t~mem58#1.base, dev_name_#t~mem58#1.offset; [2025-02-06 08:26:22,133 INFO L1309 $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-02-06 08:26:22,133 INFO L1309 $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-02-06 08:26:22,133 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4362: havoc iminor_#t~mem65#1; [2025-02-06 08:26:22,133 INFO L1309 $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-02-06 08:26:22,133 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11239: havoc usb_find_interface_#t~ret556#1.base, usb_find_interface_#t~ret556#1.offset; [2025-02-06 08:26:22,134 INFO L1309 $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-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4241: havoc kobject_name_#t~mem39#1.base, kobject_name_#t~mem39#1.offset; [2025-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6489: havoc ldv_usb_submit_urb_118_#t~nondet374#1; [2025-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11246: havoc usb_register_dev_#t~nondet557#1; [2025-02-06 08:26:22,134 INFO L1309 $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-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4247: havoc usb_endpoint_dir_in_#t~mem40#1; [2025-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11250: havoc usb_register_driver_#t~nondet558#1; [2025-02-06 08:26:22,134 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6163-1: ldv_usb_register_driver_#res#1 := ldv_usb_register_driver_~arg0#1; [2025-02-06 08:26:22,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4253: havoc usb_endpoint_xfer_int_#t~mem41#1; [2025-02-06 08:26:22,135 INFO L1309 $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-02-06 08:26:22,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6376: havoc ldv_usb_submit_urb_104_#t~nondet370#1; [2025-02-06 08:26:22,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11199: havoc kasprintf_#t~ret551#1.base, kasprintf_#t~ret551#1.offset; [2025-02-06 08:26:22,424 INFO L? ?]: Removed 1159 outVars from TransFormulas that were not future-live. [2025-02-06 08:26:22,425 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:26:22,477 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:26:22,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:26:22,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:22 BoogieIcfgContainer [2025-02-06 08:26:22,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:26:22,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:26:22,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:26:22,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:26:22,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:26:13" (1/3) ... [2025-02-06 08:26:22,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3309ca89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:22, skipping insertion in model container [2025-02-06 08:26:22,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:26:15" (2/3) ... [2025-02-06 08:26:22,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3309ca89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:26:22, skipping insertion in model container [2025-02-06 08:26:22,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:26:22" (3/3) ... [2025-02-06 08:26:22,488 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2025-02-06 08:26:22,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:26:22,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i that has 81 procedures, 1068 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-02-06 08:26:22,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:26:22,564 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;@206a3d24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:26:22,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 08:26:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 1067 states, 693 states have (on average 1.2828282828282829) internal successors, (889), 746 states have internal predecessors, (889), 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-02-06 08:26:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:26:22,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:22,581 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-02-06 08:26:22,582 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-02-06 08:26:22,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 938547266, now seen corresponding path program 1 times [2025-02-06 08:26:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715068353] [2025-02-06 08:26:22,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:23,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:26:23,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:26:23,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:23,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715068353] [2025-02-06 08:26:24,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715068353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:24,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:24,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492805034] [2025-02-06 08:26:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:24,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:24,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:24,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:24,143 INFO L87 Difference]: Start difference. First operand has 1067 states, 693 states have (on average 1.2828282828282829) internal successors, (889), 746 states have internal predecessors, (889), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 08:26:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:24,444 INFO L93 Difference]: Finished difference Result 2085 states and 2854 transitions. [2025-02-06 08:26:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-02-06 08:26:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:24,469 INFO L225 Difference]: With dead ends: 2085 [2025-02-06 08:26:24,469 INFO L226 Difference]: Without dead ends: 1049 [2025-02-06 08:26:24,479 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-02-06 08:26:24,482 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1339 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:24,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 2717 Invalid, 24 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-06 08:26:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1049. [2025-02-06 08:26:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 683 states have (on average 1.225475841874085) internal successors, (837), 731 states have internal predecessors, (837), 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-02-06 08:26:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1353 transitions. [2025-02-06 08:26:24,611 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1353 transitions. Word has length 71 [2025-02-06 08:26:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:24,613 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1353 transitions. [2025-02-06 08:26:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 08:26:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1353 transitions. [2025-02-06 08:26:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 08:26:24,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:24,617 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-02-06 08:26:24,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:26:24,617 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-02-06 08:26:24,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:24,618 INFO L85 PathProgramCache]: Analyzing trace with hash -172231335, now seen corresponding path program 1 times [2025-02-06 08:26:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:24,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526439692] [2025-02-06 08:26:24,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:24,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:25,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 08:26:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 08:26:25,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526439692] [2025-02-06 08:26:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526439692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:25,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454059998] [2025-02-06 08:26:25,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:25,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:25,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:25,838 INFO L87 Difference]: Start difference. First operand 1049 states and 1353 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 08:26:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:25,965 INFO L93 Difference]: Finished difference Result 1049 states and 1353 transitions. [2025-02-06 08:26:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:25,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-02-06 08:26:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:25,972 INFO L225 Difference]: With dead ends: 1049 [2025-02-06 08:26:25,972 INFO L226 Difference]: Without dead ends: 1047 [2025-02-06 08:26:25,973 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-02-06 08:26:25,974 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 1318 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 2677 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-02-06 08:26:25,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 2677 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-02-06 08:26:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2025-02-06 08:26:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 682 states have (on average 1.2243401759530792) internal successors, (835), 729 states have internal predecessors, (835), 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-02-06 08:26:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1351 transitions. [2025-02-06 08:26:26,020 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1351 transitions. Word has length 77 [2025-02-06 08:26:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1351 transitions. [2025-02-06 08:26:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 08:26:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1351 transitions. [2025-02-06 08:26:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 08:26:26,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:26,025 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-02-06 08:26:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:26:26,025 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-02-06 08:26:26,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 444518044, now seen corresponding path program 1 times [2025-02-06 08:26:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367240435] [2025-02-06 08:26:26,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:26,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:26,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 08:26:26,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 08:26:26,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:26,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:26,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367240435] [2025-02-06 08:26:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367240435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:26,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700566649] [2025-02-06 08:26:26,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:26,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:26,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:26,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:26,867 INFO L87 Difference]: Start difference. First operand 1047 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:26:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:26,999 INFO L93 Difference]: Finished difference Result 1047 states and 1351 transitions. [2025-02-06 08:26:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-02-06 08:26:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:27,007 INFO L225 Difference]: With dead ends: 1047 [2025-02-06 08:26:27,007 INFO L226 Difference]: Without dead ends: 1045 [2025-02-06 08:26:27,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-02-06 08:26:27,008 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 1315 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 2673 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-02-06 08:26:27,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 2673 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-02-06 08:26:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2025-02-06 08:26:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 681 states have (on average 1.223201174743025) internal successors, (833), 727 states have internal predecessors, (833), 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-02-06 08:26:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1349 transitions. [2025-02-06 08:26:27,057 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1349 transitions. Word has length 83 [2025-02-06 08:26:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:27,057 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1349 transitions. [2025-02-06 08:26:27,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 08:26:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1349 transitions. [2025-02-06 08:26:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 08:26:27,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:27,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:27,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:26:27,059 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-02-06 08:26:27,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -449456625, now seen corresponding path program 1 times [2025-02-06 08:26:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014274636] [2025-02-06 08:26:27,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:27,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 08:26:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 08:26:27,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:27,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014274636] [2025-02-06 08:26:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014274636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496558511] [2025-02-06 08:26:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:27,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:27,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:27,964 INFO L87 Difference]: Start difference. First operand 1045 states and 1349 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:26:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:28,097 INFO L93 Difference]: Finished difference Result 1045 states and 1349 transitions. [2025-02-06 08:26:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-02-06 08:26:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:28,104 INFO L225 Difference]: With dead ends: 1045 [2025-02-06 08:26:28,104 INFO L226 Difference]: Without dead ends: 1043 [2025-02-06 08:26:28,105 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-02-06 08:26:28,106 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 1312 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 2669 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-02-06 08:26:28,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 2669 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-02-06 08:26:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2025-02-06 08:26:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 680 states have (on average 1.2220588235294119) internal successors, (831), 725 states have internal predecessors, (831), 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-02-06 08:26:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1347 transitions. [2025-02-06 08:26:28,160 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1347 transitions. Word has length 89 [2025-02-06 08:26:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:28,160 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1347 transitions. [2025-02-06 08:26:28,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 08:26:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1347 transitions. [2025-02-06 08:26:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 08:26:28,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:28,161 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-02-06 08:26:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:26:28,162 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-02-06 08:26:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -172044986, now seen corresponding path program 1 times [2025-02-06 08:26:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222653108] [2025-02-06 08:26:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:28,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 08:26:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 08:26:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222653108] [2025-02-06 08:26:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222653108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:28,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33741744] [2025-02-06 08:26:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:28,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:28,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:28,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:28,891 INFO L87 Difference]: Start difference. First operand 1043 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:26:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:29,027 INFO L93 Difference]: Finished difference Result 1043 states and 1347 transitions. [2025-02-06 08:26:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-02-06 08:26:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:29,033 INFO L225 Difference]: With dead ends: 1043 [2025-02-06 08:26:29,033 INFO L226 Difference]: Without dead ends: 1041 [2025-02-06 08:26:29,034 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-02-06 08:26:29,034 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 1309 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 2665 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-02-06 08:26:29,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 2665 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-02-06 08:26:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2025-02-06 08:26:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 679 states have (on average 1.2209131075110458) internal successors, (829), 723 states have internal predecessors, (829), 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-02-06 08:26:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1345 transitions. [2025-02-06 08:26:29,081 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1345 transitions. Word has length 95 [2025-02-06 08:26:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:29,082 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1345 transitions. [2025-02-06 08:26:29,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 08:26:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1345 transitions. [2025-02-06 08:26:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 08:26:29,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:29,086 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-02-06 08:26:29,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:26:29,086 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-02-06 08:26:29,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash 471998809, now seen corresponding path program 1 times [2025-02-06 08:26:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322131740] [2025-02-06 08:26:29,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 08:26:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 08:26:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:29,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-02-06 08:26:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322131740] [2025-02-06 08:26:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322131740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411761576] [2025-02-06 08:26:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:29,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:29,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:29,877 INFO L87 Difference]: Start difference. First operand 1041 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 08:26:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:29,993 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2025-02-06 08:26:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:29,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-02-06 08:26:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:29,999 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 08:26:29,999 INFO L226 Difference]: Without dead ends: 1039 [2025-02-06 08:26:29,999 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-02-06 08:26:30,000 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 1306 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 2661 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-02-06 08:26:30,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 2661 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-02-06 08:26:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2025-02-06 08:26:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 678 states have (on average 1.21976401179941) internal successors, (827), 721 states have internal predecessors, (827), 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-02-06 08:26:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1343 transitions. [2025-02-06 08:26:30,057 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1343 transitions. Word has length 101 [2025-02-06 08:26:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:30,058 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1343 transitions. [2025-02-06 08:26:30,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 08:26:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1343 transitions. [2025-02-06 08:26:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 08:26:30,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:30,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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:30,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:26:30,060 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-02-06 08:26:30,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash -586831403, now seen corresponding path program 1 times [2025-02-06 08:26:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:30,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003057407] [2025-02-06 08:26:30,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:30,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 08:26:30,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 08:26:30,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:30,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003057407] [2025-02-06 08:26:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003057407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961746967] [2025-02-06 08:26:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:30,819 INFO L87 Difference]: Start difference. First operand 1039 states and 1343 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:26:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:30,942 INFO L93 Difference]: Finished difference Result 1039 states and 1343 transitions. [2025-02-06 08:26:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-02-06 08:26:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:30,949 INFO L225 Difference]: With dead ends: 1039 [2025-02-06 08:26:30,950 INFO L226 Difference]: Without dead ends: 1037 [2025-02-06 08:26:30,950 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-02-06 08:26:30,950 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 1303 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 2657 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-02-06 08:26:30,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 2657 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-02-06 08:26:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2025-02-06 08:26:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 677 states have (on average 1.2186115214180206) internal successors, (825), 719 states have internal predecessors, (825), 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-02-06 08:26:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1341 transitions. [2025-02-06 08:26:31,001 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1341 transitions. Word has length 107 [2025-02-06 08:26:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:31,001 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1341 transitions. [2025-02-06 08:26:31,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 08:26:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1341 transitions. [2025-02-06 08:26:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 08:26:31,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:26:31,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:26:31,003 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-02-06 08:26:31,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:31,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1197174395, now seen corresponding path program 1 times [2025-02-06 08:26:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953279925] [2025-02-06 08:26:31,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:31,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:31,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 08:26:31,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 08:26:31,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:31,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:31,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953279925] [2025-02-06 08:26:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953279925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:31,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751585343] [2025-02-06 08:26:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:31,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:31,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:31,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:31,768 INFO L87 Difference]: Start difference. First operand 1037 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:26:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:31,888 INFO L93 Difference]: Finished difference Result 1037 states and 1341 transitions. [2025-02-06 08:26:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-02-06 08:26:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:31,895 INFO L225 Difference]: With dead ends: 1037 [2025-02-06 08:26:31,895 INFO L226 Difference]: Without dead ends: 1035 [2025-02-06 08:26:31,895 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-02-06 08:26:31,896 INFO L435 NwaCegarLoop]: 1327 mSDtfsCounter, 1300 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 2653 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-02-06 08:26:31,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 2653 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2025-02-06 08:26:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2025-02-06 08:26:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 676 states have (on average 1.217455621301775) internal successors, (823), 717 states have internal predecessors, (823), 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-02-06 08:26:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1339 transitions. [2025-02-06 08:26:31,945 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1339 transitions. Word has length 113 [2025-02-06 08:26:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:31,945 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1339 transitions. [2025-02-06 08:26:31,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:26:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1339 transitions. [2025-02-06 08:26:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 08:26:31,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:31,950 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-02-06 08:26:31,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:26:31,950 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-02-06 08:26:31,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash 566673888, now seen corresponding path program 1 times [2025-02-06 08:26:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794163013] [2025-02-06 08:26:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 08:26:32,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 08:26:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794163013] [2025-02-06 08:26:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794163013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351683452] [2025-02-06 08:26:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:32,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:32,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:32,824 INFO L87 Difference]: Start difference. First operand 1035 states and 1339 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:26:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:32,969 INFO L93 Difference]: Finished difference Result 1035 states and 1339 transitions. [2025-02-06 08:26:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:32,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2025-02-06 08:26:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:32,975 INFO L225 Difference]: With dead ends: 1035 [2025-02-06 08:26:32,975 INFO L226 Difference]: Without dead ends: 1033 [2025-02-06 08:26:32,977 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-02-06 08:26:32,978 INFO L435 NwaCegarLoop]: 1325 mSDtfsCounter, 1296 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 2649 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-02-06 08:26:32,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 2649 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-02-06 08:26:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2025-02-06 08:26:33,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 675 states have (on average 1.2162962962962962) internal successors, (821), 715 states have internal predecessors, (821), 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-02-06 08:26:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1337 transitions. [2025-02-06 08:26:33,064 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1337 transitions. Word has length 115 [2025-02-06 08:26:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:33,064 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1337 transitions. [2025-02-06 08:26:33,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 08:26:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1337 transitions. [2025-02-06 08:26:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 08:26:33,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:33,066 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] [2025-02-06 08:26:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:26:33,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-02-06 08:26:33,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1229194877, now seen corresponding path program 1 times [2025-02-06 08:26:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819601967] [2025-02-06 08:26:33,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:33,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 08:26:33,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 08:26:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:33,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:26:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819601967] [2025-02-06 08:26:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819601967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:34,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:26:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575916633] [2025-02-06 08:26:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:34,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:26:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:34,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:26:34,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:26:34,834 INFO L87 Difference]: Start difference. First operand 1033 states and 1337 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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-02-06 08:26:38,856 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-02-06 08:26:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:40,850 INFO L93 Difference]: Finished difference Result 2027 states and 2626 transitions. [2025-02-06 08:26:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:26:40,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 164 [2025-02-06 08:26:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:40,858 INFO L225 Difference]: With dead ends: 2027 [2025-02-06 08:26:40,858 INFO L226 Difference]: Without dead ends: 1033 [2025-02-06 08:26:40,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:26:40,863 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 1295 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:40,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 4772 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 567 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 08:26:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-02-06 08:26:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2025-02-06 08:26:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 675 states have (on average 1.2148148148148148) internal successors, (820), 715 states have internal predecessors, (820), 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-02-06 08:26:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1336 transitions. [2025-02-06 08:26:40,918 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1336 transitions. Word has length 164 [2025-02-06 08:26:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:40,920 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1336 transitions. [2025-02-06 08:26:40,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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-02-06 08:26:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1336 transitions. [2025-02-06 08:26:40,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 08:26:40,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:40,921 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] [2025-02-06 08:26:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:26:40,922 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-02-06 08:26:40,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1229224668, now seen corresponding path program 1 times [2025-02-06 08:26:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:40,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001917166] [2025-02-06 08:26:40,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:41,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 08:26:41,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 08:26:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:26:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001917166] [2025-02-06 08:26:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001917166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:41,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559988489] [2025-02-06 08:26:41,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:41,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:41,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:41,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:41,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:41,890 INFO L87 Difference]: Start difference. First operand 1033 states and 1336 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-06 08:26:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:42,036 INFO L93 Difference]: Finished difference Result 1033 states and 1336 transitions. [2025-02-06 08:26:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 164 [2025-02-06 08:26:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:42,043 INFO L225 Difference]: With dead ends: 1033 [2025-02-06 08:26:42,043 INFO L226 Difference]: Without dead ends: 1031 [2025-02-06 08:26:42,044 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-02-06 08:26:42,045 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 0 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3963 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-02-06 08:26:42,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3963 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-02-06 08:26:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2025-02-06 08:26:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 674 states have (on average 1.2136498516320475) internal successors, (818), 713 states have internal predecessors, (818), 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-02-06 08:26:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1334 transitions. [2025-02-06 08:26:42,095 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1334 transitions. Word has length 164 [2025-02-06 08:26:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:42,096 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1334 transitions. [2025-02-06 08:26:42,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-06 08:26:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1334 transitions. [2025-02-06 08:26:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 08:26:42,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:42,099 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-02-06 08:26:42,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:26:42,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-02-06 08:26:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1556507789, now seen corresponding path program 1 times [2025-02-06 08:26:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930034658] [2025-02-06 08:26:42,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:42,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 08:26:42,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 08:26:42,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:42,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930034658] [2025-02-06 08:26:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930034658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369898336] [2025-02-06 08:26:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:42,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:42,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:42,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:42,854 INFO L87 Difference]: Start difference. First operand 1031 states and 1334 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:26:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:43,006 INFO L93 Difference]: Finished difference Result 1031 states and 1334 transitions. [2025-02-06 08:26:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:43,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2025-02-06 08:26:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:43,012 INFO L225 Difference]: With dead ends: 1031 [2025-02-06 08:26:43,012 INFO L226 Difference]: Without dead ends: 1029 [2025-02-06 08:26:43,012 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-02-06 08:26:43,013 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 1292 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2639 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-02-06 08:26:43,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2639 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-02-06 08:26:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2025-02-06 08:26:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 673 states have (on average 1.212481426448737) internal successors, (816), 711 states have internal predecessors, (816), 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-02-06 08:26:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1332 transitions. [2025-02-06 08:26:43,101 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1332 transitions. Word has length 121 [2025-02-06 08:26:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1332 transitions. [2025-02-06 08:26:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 08:26:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1332 transitions. [2025-02-06 08:26:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 08:26:43,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:43,104 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-02-06 08:26:43,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:26:43,104 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-02-06 08:26:43,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2121496078, now seen corresponding path program 1 times [2025-02-06 08:26:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999355326] [2025-02-06 08:26:43,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:43,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 08:26:43,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 08:26:43,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999355326] [2025-02-06 08:26:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999355326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86819764] [2025-02-06 08:26:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:44,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:44,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:44,003 INFO L87 Difference]: Start difference. First operand 1029 states and 1332 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:26:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:44,144 INFO L93 Difference]: Finished difference Result 1029 states and 1332 transitions. [2025-02-06 08:26:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-02-06 08:26:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:44,150 INFO L225 Difference]: With dead ends: 1029 [2025-02-06 08:26:44,150 INFO L226 Difference]: Without dead ends: 1027 [2025-02-06 08:26:44,150 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-02-06 08:26:44,151 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 1289 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 2635 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-02-06 08:26:44,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 2635 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-02-06 08:26:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1027. [2025-02-06 08:26:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 672 states have (on average 1.2113095238095237) internal successors, (814), 709 states have internal predecessors, (814), 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-02-06 08:26:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1330 transitions. [2025-02-06 08:26:44,205 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1330 transitions. Word has length 127 [2025-02-06 08:26:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:44,205 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1330 transitions. [2025-02-06 08:26:44,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-06 08:26:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1330 transitions. [2025-02-06 08:26:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 08:26:44,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:44,207 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:44,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:26:44,207 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-02-06 08:26:44,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1433912156, now seen corresponding path program 1 times [2025-02-06 08:26:44,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:44,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744094308] [2025-02-06 08:26:44,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:44,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 08:26:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 08:26:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:26:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744094308] [2025-02-06 08:26:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744094308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:26:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282204738] [2025-02-06 08:26:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:44,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:26:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:44,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:26:44,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:26:44,870 INFO L87 Difference]: Start difference. First operand 1027 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02-06 08:26:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:44,968 INFO L93 Difference]: Finished difference Result 2011 states and 2608 transitions. [2025-02-06 08:26:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:26:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 171 [2025-02-06 08:26:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:44,974 INFO L225 Difference]: With dead ends: 2011 [2025-02-06 08:26:44,974 INFO L226 Difference]: Without dead ends: 1023 [2025-02-06 08:26:44,978 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-02-06 08:26:44,978 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 1284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1314 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-02-06 08:26:44,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-02-06 08:26:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2025-02-06 08:26:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 669 states have (on average 1.2092675635276533) internal successors, (809), 705 states have internal predecessors, (809), 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-02-06 08:26:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1325 transitions. [2025-02-06 08:26:45,042 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1325 transitions. Word has length 171 [2025-02-06 08:26:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:45,043 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1325 transitions. [2025-02-06 08:26:45,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-02-06 08:26:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1325 transitions. [2025-02-06 08:26:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 08:26:45,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:45,046 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-02-06 08:26:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:26:45,046 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-02-06 08:26:45,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1771173398, now seen corresponding path program 1 times [2025-02-06 08:26:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103346890] [2025-02-06 08:26:45,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:45,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 08:26:45,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 08:26:45,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:45,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103346890] [2025-02-06 08:26:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103346890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030999110] [2025-02-06 08:26:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:45,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:45,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:45,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:45,888 INFO L87 Difference]: Start difference. First operand 1023 states and 1325 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:26:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:46,015 INFO L93 Difference]: Finished difference Result 1023 states and 1325 transitions. [2025-02-06 08:26:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-02-06 08:26:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:46,023 INFO L225 Difference]: With dead ends: 1023 [2025-02-06 08:26:46,023 INFO L226 Difference]: Without dead ends: 1021 [2025-02-06 08:26:46,024 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-02-06 08:26:46,025 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 1281 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 2621 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-02-06 08:26:46,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 2621 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-06 08:26:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-02-06 08:26:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 668 states have (on average 1.2080838323353293) internal successors, (807), 703 states have internal predecessors, (807), 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-02-06 08:26:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1323 transitions. [2025-02-06 08:26:46,085 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1323 transitions. Word has length 133 [2025-02-06 08:26:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1323 transitions. [2025-02-06 08:26:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 08:26:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1323 transitions. [2025-02-06 08:26:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 08:26:46,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:46,092 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:26:46,093 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-02-06 08:26:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash 931127326, now seen corresponding path program 1 times [2025-02-06 08:26:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298752662] [2025-02-06 08:26:46,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:46,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 08:26:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 08:26:46,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:46,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 08:26:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:47,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298752662] [2025-02-06 08:26:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298752662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:26:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208453328] [2025-02-06 08:26:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:47,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:26:47,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:47,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:26:47,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:26:47,055 INFO L87 Difference]: Start difference. First operand 1021 states and 1323 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 08:26:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:47,288 INFO L93 Difference]: Finished difference Result 1751 states and 2230 transitions. [2025-02-06 08:26:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:26:47,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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 167 [2025-02-06 08:26:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:47,294 INFO L225 Difference]: With dead ends: 1751 [2025-02-06 08:26:47,294 INFO L226 Difference]: Without dead ends: 1026 [2025-02-06 08:26:47,296 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-02-06 08:26:47,297 INFO L435 NwaCegarLoop]: 1310 mSDtfsCounter, 0 mSDsluCounter, 5233 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6543 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-02-06 08:26:47,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6543 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:26:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-02-06 08:26:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2025-02-06 08:26:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 672 states have (on average 1.2068452380952381) internal successors, (811), 707 states have internal predecessors, (811), 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-02-06 08:26:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1331 transitions. [2025-02-06 08:26:47,363 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1331 transitions. Word has length 167 [2025-02-06 08:26:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:47,363 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1331 transitions. [2025-02-06 08:26:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 08:26:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1331 transitions. [2025-02-06 08:26:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 08:26:47,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:47,366 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-02-06 08:26:47,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:26:47,366 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-02-06 08:26:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash -921070784, now seen corresponding path program 1 times [2025-02-06 08:26:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159961962] [2025-02-06 08:26:47,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:47,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 08:26:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 08:26:47,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:47,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159961962] [2025-02-06 08:26:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159961962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205633194] [2025-02-06 08:26:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:48,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:48,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:48,038 INFO L87 Difference]: Start difference. First operand 1026 states and 1331 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 08:26:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:48,149 INFO L93 Difference]: Finished difference Result 1026 states and 1331 transitions. [2025-02-06 08:26:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:48,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-02-06 08:26:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:48,155 INFO L225 Difference]: With dead ends: 1026 [2025-02-06 08:26:48,155 INFO L226 Difference]: Without dead ends: 1024 [2025-02-06 08:26:48,156 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-02-06 08:26:48,157 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1278 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 2617 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-02-06 08:26:48,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 2617 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-02-06 08:26:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2025-02-06 08:26:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 671 states have (on average 1.2056631892697467) internal successors, (809), 705 states have internal predecessors, (809), 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-02-06 08:26:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1329 transitions. [2025-02-06 08:26:48,212 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1329 transitions. Word has length 139 [2025-02-06 08:26:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1329 transitions. [2025-02-06 08:26:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 08:26:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1329 transitions. [2025-02-06 08:26:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-06 08:26:48,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:48,214 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-02-06 08:26:48,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:26:48,214 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-02-06 08:26:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -75299663, now seen corresponding path program 1 times [2025-02-06 08:26:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:48,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455441797] [2025-02-06 08:26:48,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:48,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:48,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-06 08:26:48,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-06 08:26:48,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:48,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:48,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:48,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455441797] [2025-02-06 08:26:48,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455441797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:48,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:48,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794151365] [2025-02-06 08:26:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:48,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:48,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:48,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:48,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:48,989 INFO L87 Difference]: Start difference. First operand 1024 states and 1329 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 08:26:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:49,098 INFO L93 Difference]: Finished difference Result 1024 states and 1329 transitions. [2025-02-06 08:26:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:49,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-02-06 08:26:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:49,107 INFO L225 Difference]: With dead ends: 1024 [2025-02-06 08:26:49,107 INFO L226 Difference]: Without dead ends: 1022 [2025-02-06 08:26:49,107 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-02-06 08:26:49,108 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1275 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2613 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-02-06 08:26:49,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2613 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-06 08:26:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2025-02-06 08:26:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 670 states have (on average 1.2044776119402985) internal successors, (807), 703 states have internal predecessors, (807), 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-02-06 08:26:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1327 transitions. [2025-02-06 08:26:49,180 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1327 transitions. Word has length 145 [2025-02-06 08:26:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:49,180 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1327 transitions. [2025-02-06 08:26:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-06 08:26:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1327 transitions. [2025-02-06 08:26:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-06 08:26:49,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:49,182 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] [2025-02-06 08:26:49,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:26:49,183 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-02-06 08:26:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1938302531, now seen corresponding path program 1 times [2025-02-06 08:26:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306119922] [2025-02-06 08:26:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 08:26:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 08:26:49,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:49,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-02-06 08:26:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306119922] [2025-02-06 08:26:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306119922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:26:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571037876] [2025-02-06 08:26:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:50,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:26:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:50,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:26:50,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:50,121 INFO L87 Difference]: Start difference. First operand 1022 states and 1327 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-02-06 08:26:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:50,323 INFO L93 Difference]: Finished difference Result 1127 states and 1431 transitions. [2025-02-06 08:26:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:26:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 183 [2025-02-06 08:26:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:50,330 INFO L225 Difference]: With dead ends: 1127 [2025-02-06 08:26:50,330 INFO L226 Difference]: Without dead ends: 1125 [2025-02-06 08:26:50,330 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-02-06 08:26:50,331 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1170 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 4220 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-02-06 08:26:50,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 4220 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2025-02-06 08:26:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2025-02-06 08:26:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 735 states have (on average 1.2) internal successors, (882), 768 states have internal predecessors, (882), 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-02-06 08:26:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1426 transitions. [2025-02-06 08:26:50,397 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1426 transitions. Word has length 183 [2025-02-06 08:26:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:50,398 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1426 transitions. [2025-02-06 08:26:50,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-02-06 08:26:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1426 transitions. [2025-02-06 08:26:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 08:26:50,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:50,399 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-02-06 08:26:50,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:26:50,400 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-02-06 08:26:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 670994828, now seen corresponding path program 1 times [2025-02-06 08:26:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093524354] [2025-02-06 08:26:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:50,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 08:26:50,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 08:26:50,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093524354] [2025-02-06 08:26:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093524354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752361155] [2025-02-06 08:26:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:51,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:51,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:51,107 INFO L87 Difference]: Start difference. First operand 1119 states and 1426 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:26:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:51,248 INFO L93 Difference]: Finished difference Result 1119 states and 1426 transitions. [2025-02-06 08:26:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-02-06 08:26:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:51,254 INFO L225 Difference]: With dead ends: 1119 [2025-02-06 08:26:51,254 INFO L226 Difference]: Without dead ends: 1117 [2025-02-06 08:26:51,255 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-02-06 08:26:51,255 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 1272 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2609 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-02-06 08:26:51,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 2609 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-02-06 08:26:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2025-02-06 08:26:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 734 states have (on average 1.1989100817438691) internal successors, (880), 766 states have internal predecessors, (880), 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-02-06 08:26:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1424 transitions. [2025-02-06 08:26:51,327 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1424 transitions. Word has length 151 [2025-02-06 08:26:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:51,327 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1424 transitions. [2025-02-06 08:26:51,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 08:26:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1424 transitions. [2025-02-06 08:26:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 08:26:51,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:51,329 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-02-06 08:26:51,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:26:51,329 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-02-06 08:26:51,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1150062264, now seen corresponding path program 1 times [2025-02-06 08:26:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:51,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108249410] [2025-02-06 08:26:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 08:26:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 08:26:52,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:52,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:52,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:52,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108249410] [2025-02-06 08:26:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108249410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:52,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578090953] [2025-02-06 08:26:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:52,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:52,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:52,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:52,318 INFO L87 Difference]: Start difference. First operand 1117 states and 1424 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:26:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:52,482 INFO L93 Difference]: Finished difference Result 1117 states and 1424 transitions. [2025-02-06 08:26:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:52,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-02-06 08:26:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:52,488 INFO L225 Difference]: With dead ends: 1117 [2025-02-06 08:26:52,488 INFO L226 Difference]: Without dead ends: 1115 [2025-02-06 08:26:52,489 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-02-06 08:26:52,490 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 1269 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 2605 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-02-06 08:26:52,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 2605 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-02-06 08:26:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-02-06 08:26:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 733 states have (on average 1.1978171896316507) internal successors, (878), 764 states have internal predecessors, (878), 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-02-06 08:26:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1422 transitions. [2025-02-06 08:26:52,587 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1422 transitions. Word has length 157 [2025-02-06 08:26:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:52,588 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1422 transitions. [2025-02-06 08:26:52,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 08:26:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1422 transitions. [2025-02-06 08:26:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-06 08:26:52,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:52,591 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:52,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:26:52,591 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-02-06 08:26:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash -903755812, now seen corresponding path program 1 times [2025-02-06 08:26:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083599306] [2025-02-06 08:26:52,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:53,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 08:26:53,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 08:26:53,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:53,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-02-06 08:26:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083599306] [2025-02-06 08:26:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083599306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:53,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:53,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:26:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660937070] [2025-02-06 08:26:53,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:53,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:26:53,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:53,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:26:53,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:26:53,267 INFO L87 Difference]: Start difference. First operand 1115 states and 1422 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, (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-02-06 08:26:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:53,393 INFO L93 Difference]: Finished difference Result 2076 states and 2619 transitions. [2025-02-06 08:26:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:26:53,394 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, (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 203 [2025-02-06 08:26:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:53,399 INFO L225 Difference]: With dead ends: 2076 [2025-02-06 08:26:53,399 INFO L226 Difference]: Without dead ends: 1111 [2025-02-06 08:26:53,402 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-02-06 08:26:53,403 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 1294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1299 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:26:53,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1299 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:26:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-02-06 08:26:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2025-02-06 08:26:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 730 states have (on average 1.1958904109589041) internal successors, (873), 760 states have internal predecessors, (873), 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-02-06 08:26:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1417 transitions. [2025-02-06 08:26:53,474 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1417 transitions. Word has length 203 [2025-02-06 08:26:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:53,475 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1417 transitions. [2025-02-06 08:26:53,475 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, (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-02-06 08:26:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1417 transitions. [2025-02-06 08:26:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:26:53,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:53,477 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-02-06 08:26:53,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:26:53,477 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-02-06 08:26:53,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:53,477 INFO L85 PathProgramCache]: Analyzing trace with hash 372169086, now seen corresponding path program 1 times [2025-02-06 08:26:53,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:53,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268778859] [2025-02-06 08:26:53,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:53,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:26:53,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:26:53,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:53,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:26:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268778859] [2025-02-06 08:26:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268778859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:26:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407428309] [2025-02-06 08:26:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:54,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:26:54,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:54,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:26:54,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:26:54,162 INFO L87 Difference]: Start difference. First operand 1111 states and 1417 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 08:26:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:54,335 INFO L93 Difference]: Finished difference Result 1111 states and 1417 transitions. [2025-02-06 08:26:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:26:54,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-02-06 08:26:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:54,340 INFO L225 Difference]: With dead ends: 1111 [2025-02-06 08:26:54,341 INFO L226 Difference]: Without dead ends: 1109 [2025-02-06 08:26:54,341 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-02-06 08:26:54,342 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 1261 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2591 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-02-06 08:26:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2591 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-02-06 08:26:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2025-02-06 08:26:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 729 states have (on average 1.1947873799725652) internal successors, (871), 758 states have internal predecessors, (871), 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-02-06 08:26:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1415 transitions. [2025-02-06 08:26:54,421 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1415 transitions. Word has length 163 [2025-02-06 08:26:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:54,421 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1415 transitions. [2025-02-06 08:26:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 08:26:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1415 transitions. [2025-02-06 08:26:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-06 08:26:54,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:54,424 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] [2025-02-06 08:26:54,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:26:54,424 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-02-06 08:26:54,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:54,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1010075013, now seen corresponding path program 1 times [2025-02-06 08:26:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925805633] [2025-02-06 08:26:54,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:54,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:54,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 08:26:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 08:26:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-06 08:26:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925805633] [2025-02-06 08:26:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925805633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:26:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470002932] [2025-02-06 08:26:55,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:55,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:26:55,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:26:55,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:26:55,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:26:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 08:26:56,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 08:26:56,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:56,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:56,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 08:26:56,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:26:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-06 08:26:57,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:26:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470002932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:26:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 08:26:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934918663] [2025-02-06 08:26:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:26:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:26:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:26:57,040 INFO L87 Difference]: Start difference. First operand 1109 states and 1415 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-02-06 08:26:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:26:57,180 INFO L93 Difference]: Finished difference Result 2117 states and 2671 transitions. [2025-02-06 08:26:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:26:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 209 [2025-02-06 08:26:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:26:57,187 INFO L225 Difference]: With dead ends: 2117 [2025-02-06 08:26:57,187 INFO L226 Difference]: Without dead ends: 1161 [2025-02-06 08:26:57,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:26:57,190 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 1237 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 1422 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-02-06 08:26:57,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 1422 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:26:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-02-06 08:26:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1158. [2025-02-06 08:26:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 758 states have (on average 1.1886543535620053) internal successors, (901), 790 states have internal predecessors, (901), 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-02-06 08:26:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1475 transitions. [2025-02-06 08:26:57,277 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1475 transitions. Word has length 209 [2025-02-06 08:26:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:26:57,278 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1475 transitions. [2025-02-06 08:26:57,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-02-06 08:26:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1475 transitions. [2025-02-06 08:26:57,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-06 08:26:57,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:26:57,280 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:26:57,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 08:26:57,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 08:26:57,481 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-02-06 08:26:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:26:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -901555445, now seen corresponding path program 1 times [2025-02-06 08:26:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:26:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148695082] [2025-02-06 08:26:57,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:26:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:26:57,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-06 08:26:58,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-06 08:26:58,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:26:58,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:26:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-02-06 08:26:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:26:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148695082] [2025-02-06 08:26:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148695082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:26:58,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:26:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:26:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382423699] [2025-02-06 08:26:58,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:26:58,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:26:58,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:26:58,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:26:58,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:26:58,408 INFO L87 Difference]: Start difference. First operand 1158 states and 1475 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-02-06 08:27:02,425 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-02-06 08:27:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:02,717 INFO L93 Difference]: Finished difference Result 1170 states and 1483 transitions. [2025-02-06 08:27:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:02,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 201 [2025-02-06 08:27:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:02,722 INFO L225 Difference]: With dead ends: 1170 [2025-02-06 08:27:02,723 INFO L226 Difference]: Without dead ends: 1168 [2025-02-06 08:27:02,723 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-02-06 08:27:02,723 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 196 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 5251 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 5251 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 08:27:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-02-06 08:27:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1162. [2025-02-06 08:27:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 761 states have (on average 1.187910643889619) internal successors, (904), 793 states have internal predecessors, (904), 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-02-06 08:27:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1478 transitions. [2025-02-06 08:27:02,803 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1478 transitions. Word has length 201 [2025-02-06 08:27:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:02,804 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1478 transitions. [2025-02-06 08:27:02,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-02-06 08:27:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1478 transitions. [2025-02-06 08:27:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-06 08:27:02,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:02,806 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 08:27:02,806 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-02-06 08:27:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1010118133, now seen corresponding path program 1 times [2025-02-06 08:27:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272453095] [2025-02-06 08:27:02,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:02,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:03,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-06 08:27:03,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-06 08:27:03,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:03,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-02-06 08:27:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272453095] [2025-02-06 08:27:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272453095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:27:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338777806] [2025-02-06 08:27:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:27:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:03,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:27:03,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:27:03,734 INFO L87 Difference]: Start difference. First operand 1162 states and 1478 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-02-06 08:27:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:04,150 INFO L93 Difference]: Finished difference Result 1897 states and 2379 transitions. [2025-02-06 08:27:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:27:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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 201 [2025-02-06 08:27:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:04,170 INFO L225 Difference]: With dead ends: 1897 [2025-02-06 08:27:04,171 INFO L226 Difference]: Without dead ends: 1895 [2025-02-06 08:27:04,172 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-02-06 08:27:04,172 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 1227 mSDsluCounter, 4156 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 5816 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-02-06 08:27:04,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 5816 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:27:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-02-06 08:27:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1833. [2025-02-06 08:27:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1225 states have (on average 1.1942857142857144) internal successors, (1463), 1273 states have internal predecessors, (1463), 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-02-06 08:27:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2313 transitions. [2025-02-06 08:27:04,310 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2313 transitions. Word has length 201 [2025-02-06 08:27:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:04,311 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2313 transitions. [2025-02-06 08:27:04,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 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-02-06 08:27:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2313 transitions. [2025-02-06 08:27:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-06 08:27:04,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:04,313 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-02-06 08:27:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 08:27:04,313 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-02-06 08:27:04,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1534688901, now seen corresponding path program 1 times [2025-02-06 08:27:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885725127] [2025-02-06 08:27:04,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:04,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 08:27:04,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 08:27:04,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885725127] [2025-02-06 08:27:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885725127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252404059] [2025-02-06 08:27:05,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:05,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:05,042 INFO L87 Difference]: Start difference. First operand 1833 states and 2313 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 08:27:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:05,240 INFO L93 Difference]: Finished difference Result 1833 states and 2313 transitions. [2025-02-06 08:27:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2025-02-06 08:27:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:05,247 INFO L225 Difference]: With dead ends: 1833 [2025-02-06 08:27:05,248 INFO L226 Difference]: Without dead ends: 1831 [2025-02-06 08:27:05,248 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-02-06 08:27:05,249 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 1253 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2577 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-02-06 08:27:05,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2577 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-02-06 08:27:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1831. [2025-02-06 08:27:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1224 states have (on average 1.1928104575163399) internal successors, (1460), 1271 states have internal predecessors, (1460), 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-02-06 08:27:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2310 transitions. [2025-02-06 08:27:05,388 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2310 transitions. Word has length 169 [2025-02-06 08:27:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2310 transitions. [2025-02-06 08:27:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 08:27:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2310 transitions. [2025-02-06 08:27:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 08:27:05,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:05,391 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-02-06 08:27:05,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 08:27:05,391 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-02-06 08:27:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash 239309115, now seen corresponding path program 1 times [2025-02-06 08:27:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004502246] [2025-02-06 08:27:05,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:05,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 08:27:05,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 08:27:05,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:05,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004502246] [2025-02-06 08:27:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004502246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:06,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:06,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321693281] [2025-02-06 08:27:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:06,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:06,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:06,110 INFO L87 Difference]: Start difference. First operand 1831 states and 2310 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:06,327 INFO L93 Difference]: Finished difference Result 1831 states and 2310 transitions. [2025-02-06 08:27:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-02-06 08:27:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:06,337 INFO L225 Difference]: With dead ends: 1831 [2025-02-06 08:27:06,337 INFO L226 Difference]: Without dead ends: 1829 [2025-02-06 08:27:06,338 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-02-06 08:27:06,339 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 1250 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 2573 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-02-06 08:27:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 2573 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-02-06 08:27:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2025-02-06 08:27:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1223 states have (on average 1.1913327882256746) internal successors, (1457), 1269 states have internal predecessors, (1457), 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-02-06 08:27:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2307 transitions. [2025-02-06 08:27:06,484 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2307 transitions. Word has length 175 [2025-02-06 08:27:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:06,485 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2307 transitions. [2025-02-06 08:27:06,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 08:27:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2307 transitions. [2025-02-06 08:27:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-06 08:27:06,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:06,488 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 08:27:06,488 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-02-06 08:27:06,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash -29547556, now seen corresponding path program 1 times [2025-02-06 08:27:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:06,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161858631] [2025-02-06 08:27:06,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-06 08:27:07,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-06 08:27:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-02-06 08:27:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161858631] [2025-02-06 08:27:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161858631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:07,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:27:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376211631] [2025-02-06 08:27:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:07,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:27:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:07,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:27:07,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:27:07,849 INFO L87 Difference]: Start difference. First operand 1829 states and 2307 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 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-02-06 08:27:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:08,468 INFO L93 Difference]: Finished difference Result 3570 states and 4498 transitions. [2025-02-06 08:27:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:27:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 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 225 [2025-02-06 08:27:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:08,476 INFO L225 Difference]: With dead ends: 3570 [2025-02-06 08:27:08,476 INFO L226 Difference]: Without dead ends: 1836 [2025-02-06 08:27:08,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:27:08,484 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 0 mSDsluCounter, 7689 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8975 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:08,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8975 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:27:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2025-02-06 08:27:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1836. [2025-02-06 08:27:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1228 states have (on average 1.1905537459283388) internal successors, (1462), 1273 states have internal predecessors, (1462), 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-02-06 08:27:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2318 transitions. [2025-02-06 08:27:08,624 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2318 transitions. Word has length 225 [2025-02-06 08:27:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:08,625 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2318 transitions. [2025-02-06 08:27:08,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 6 states have internal predecessors, (84), 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-02-06 08:27:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2318 transitions. [2025-02-06 08:27:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 08:27:08,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:08,628 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-02-06 08:27:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 08:27:08,628 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-02-06 08:27:08,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1126012216, now seen corresponding path program 1 times [2025-02-06 08:27:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335189452] [2025-02-06 08:27:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:08,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 08:27:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 08:27:09,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335189452] [2025-02-06 08:27:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335189452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599532156] [2025-02-06 08:27:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:09,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:09,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:09,298 INFO L87 Difference]: Start difference. First operand 1836 states and 2318 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-02-06 08:27:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:09,515 INFO L93 Difference]: Finished difference Result 1836 states and 2318 transitions. [2025-02-06 08:27:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 181 [2025-02-06 08:27:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:09,521 INFO L225 Difference]: With dead ends: 1836 [2025-02-06 08:27:09,521 INFO L226 Difference]: Without dead ends: 1834 [2025-02-06 08:27:09,522 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-02-06 08:27:09,522 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 1247 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 2569 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-02-06 08:27:09,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 2569 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 08:27:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2025-02-06 08:27:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2025-02-06 08:27:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1227 states have (on average 1.189079054604727) internal successors, (1459), 1271 states have internal predecessors, (1459), 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-02-06 08:27:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2315 transitions. [2025-02-06 08:27:09,667 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2315 transitions. Word has length 181 [2025-02-06 08:27:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:09,668 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2315 transitions. [2025-02-06 08:27:09,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-02-06 08:27:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2315 transitions. [2025-02-06 08:27:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-06 08:27:09,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:09,671 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, 1, 1, 1, 1] [2025-02-06 08:27:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 08:27:09,671 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-02-06 08:27:09,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:09,671 INFO L85 PathProgramCache]: Analyzing trace with hash -710737833, now seen corresponding path program 1 times [2025-02-06 08:27:09,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796552823] [2025-02-06 08:27:09,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:09,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:10,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-06 08:27:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-06 08:27:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-02-06 08:27:12,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:12,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796552823] [2025-02-06 08:27:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796552823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:12,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 08:27:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345421504] [2025-02-06 08:27:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 08:27:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:12,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 08:27:12,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-06 08:27:12,593 INFO L87 Difference]: Start difference. First operand 1834 states and 2315 transitions. Second operand has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 11 states have internal predecessors, (86), 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-02-06 08:27:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:14,479 INFO L93 Difference]: Finished difference Result 3492 states and 4379 transitions. [2025-02-06 08:27:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 08:27:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 11 states have internal predecessors, (86), 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 241 [2025-02-06 08:27:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:14,486 INFO L225 Difference]: With dead ends: 3492 [2025-02-06 08:27:14,486 INFO L226 Difference]: Without dead ends: 1864 [2025-02-06 08:27:14,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:27:14,491 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 83 mSDsluCounter, 14803 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 16052 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:27:14,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 16052 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 08:27:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2025-02-06 08:27:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1852. [2025-02-06 08:27:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1236 states have (on average 1.1877022653721683) internal successors, (1468), 1281 states have internal predecessors, (1468), 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-02-06 08:27:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2339 transitions. [2025-02-06 08:27:14,673 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2339 transitions. Word has length 241 [2025-02-06 08:27:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2339 transitions. [2025-02-06 08:27:14,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 11 states have internal predecessors, (86), 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-02-06 08:27:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2339 transitions. [2025-02-06 08:27:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 08:27:14,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:14,678 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, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:14,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 08:27:14,678 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-02-06 08:27:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1687532602, now seen corresponding path program 1 times [2025-02-06 08:27:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069178269] [2025-02-06 08:27:14,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:14,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:15,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 08:27:15,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 08:27:15,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:15,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 08:27:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069178269] [2025-02-06 08:27:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069178269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:15,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:27:15,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:27:15,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001837694] [2025-02-06 08:27:15,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:15,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:27:15,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:15,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:27:15,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:27:15,382 INFO L87 Difference]: Start difference. First operand 1852 states and 2339 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-02-06 08:27:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:27:15,824 INFO L93 Difference]: Finished difference Result 3575 states and 4509 transitions. [2025-02-06 08:27:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:27:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 187 [2025-02-06 08:27:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:27:15,834 INFO L225 Difference]: With dead ends: 3575 [2025-02-06 08:27:15,835 INFO L226 Difference]: Without dead ends: 3292 [2025-02-06 08:27:15,836 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-02-06 08:27:15,837 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 1242 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 3880 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-02-06 08:27:15,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 3880 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:27:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2025-02-06 08:27:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3273. [2025-02-06 08:27:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 2199 states have (on average 1.2014552069122328) internal successors, (2642), 2271 states have internal predecessors, (2642), 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-02-06 08:27:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 4182 transitions. [2025-02-06 08:27:16,113 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 4182 transitions. Word has length 187 [2025-02-06 08:27:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:27:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 4182 transitions. [2025-02-06 08:27:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-02-06 08:27:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 4182 transitions. [2025-02-06 08:27:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-06 08:27:16,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:27:16,115 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:27:16,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 08:27:16,115 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-02-06 08:27:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:27:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -996841838, now seen corresponding path program 1 times [2025-02-06 08:27:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:27:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989183976] [2025-02-06 08:27:16,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:27:16,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-06 08:27:16,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-06 08:27:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-02-06 08:27:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:27:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989183976] [2025-02-06 08:27:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989183976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:27:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204493383] [2025-02-06 08:27:17,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:27:17,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:27:17,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:27:17,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:27:17,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:27:19,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-06 08:27:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-06 08:27:19,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:27:19,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:27:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 2784 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 08:27:19,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:27:19,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 08:27:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-02-06 08:27:20,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 08:27:20,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204493383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:27:20,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 08:27:20,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-02-06 08:27:20,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244205975] [2025-02-06 08:27:20,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:27:20,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:27:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:27:20,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:27:20,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-06 08:27:20,235 INFO L87 Difference]: Start difference. First operand 3273 states and 4182 transitions. Second operand has 10 states, 9 states have (on average 10.0) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (31), 5 states have call predecessors, (31), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29)