./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--host--u132-hcd.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.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 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:32:01,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:32:01,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 20:32:01,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:32:01,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:32:01,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:32:01,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:32:01,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:32:01,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:32:01,945 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:32:01,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:32:01,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:32:01,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:32:01,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:32:01,945 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:32:01,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:32:01,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:32:01,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:01,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:32:01,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:01,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:32:01,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:32:01,948 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 -> 59b1cfb91cc72e499bff6d8fc699fc231e5a5cccbbf2aefe05d1bfd2696fc05b [2025-01-09 20:32:02,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:32:02,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:32:02,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:32:02,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:32:02,191 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:32:02,192 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--host--u132-hcd.ko.cil.i [2025-01-09 20:32:03,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/188980ebc/6ce0bee81f364805bffc7ec3f86f040f/FLAGde05da552 [2025-01-09 20:32:04,129 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:32:04,131 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--host--u132-hcd.ko.cil.i [2025-01-09 20:32:04,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/188980ebc/6ce0bee81f364805bffc7ec3f86f040f/FLAGde05da552 [2025-01-09 20:32:04,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/188980ebc/6ce0bee81f364805bffc7ec3f86f040f [2025-01-09 20:32:04,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:32:04,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:32:04,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:32:04,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:32:04,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:32:04,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:32:04" (1/1) ... [2025-01-09 20:32:04,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3063ff3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:04, skipping insertion in model container [2025-01-09 20:32:04,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:32:04" (1/1) ... [2025-01-09 20:32:04,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:32:06,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2025-01-09 20:32:06,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2025-01-09 20:32:06,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2025-01-09 20:32:06,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2025-01-09 20:32:06,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2025-01-09 20:32:06,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2025-01-09 20:32:06,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2025-01-09 20:32:06,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2025-01-09 20:32:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2025-01-09 20:32:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2025-01-09 20:32:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2025-01-09 20:32:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2025-01-09 20:32:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[436554,436567] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[436714,436727] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[436865,436878] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437016,437029] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437168,437181] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437317,437330] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437465,437478] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437622,437635] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437771,437784] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[437927,437940] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438080,438093] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438226,438239] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438369,438382] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438521,438534] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438667,438680] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438812,438825] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[438966,438979] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439117,439130] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439272,439285] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439424,439437] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439579,439592] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439743,439756] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[439899,439912] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440063,440076] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440205,440218] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440363,440376] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440530,440543] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440689,440702] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440848,440861] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[440997,441010] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441144,441157] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441283,441296] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441446,441459] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441612,441625] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441776,441789] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[441941,441954] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[442106,442119] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[442272,442285] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[442437,442450] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[442604,442617] [2025-01-09 20:32:06,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2025-01-09 20:32:06,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2025-01-09 20:32:06,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2025-01-09 20:32:06,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[443374,443387] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[443518,443531] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[443661,443674] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[443805,443818] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[443946,443959] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444084,444097] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444242,444255] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444401,444414] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444557,444570] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444706,444719] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[444858,444871] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445009,445022] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445158,445171] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445310,445323] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445458,445471] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445611,445624] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445762,445775] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[445912,445925] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446059,446072] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446210,446223] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446361,446374] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446509,446522] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446675,446688] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[446844,446857] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447011,447024] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447179,447192] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447329,447342] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447476,447489] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447637,447650] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447807,447820] [2025-01-09 20:32:06,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--host--u132-hcd.ko.cil.i[447969,447982] [2025-01-09 20:32:06,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:32:06,653 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:32:06,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [4421-4422] [2025-01-09 20:32:06,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [4427-4429] [2025-01-09 20:32:06,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434581,434594] [2025-01-09 20:32:06,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434726,434739] [2025-01-09 20:32:06,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[434872,434885] [2025-01-09 20:32:06,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435037,435050] [2025-01-09 20:32:06,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435195,435208] [2025-01-09 20:32:06,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435353,435366] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435511,435524] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435671,435684] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435830,435843] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[435969,435982] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436111,436124] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436260,436273] [2025-01-09 20:32:06,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436399,436412] [2025-01-09 20:32:06,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436554,436567] [2025-01-09 20:32:06,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436714,436727] [2025-01-09 20:32:06,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[436865,436878] [2025-01-09 20:32:06,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437016,437029] [2025-01-09 20:32:06,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437168,437181] [2025-01-09 20:32:06,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437317,437330] [2025-01-09 20:32:06,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437465,437478] [2025-01-09 20:32:06,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437622,437635] [2025-01-09 20:32:06,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437771,437784] [2025-01-09 20:32:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[437927,437940] [2025-01-09 20:32:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438080,438093] [2025-01-09 20:32:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438226,438239] [2025-01-09 20:32:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438369,438382] [2025-01-09 20:32:06,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438521,438534] [2025-01-09 20:32:06,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438667,438680] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438812,438825] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[438966,438979] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439117,439130] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439272,439285] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439424,439437] [2025-01-09 20:32:06,992 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439579,439592] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439743,439756] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[439899,439912] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440063,440076] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440205,440218] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440363,440376] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440530,440543] [2025-01-09 20:32:06,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440689,440702] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440848,440861] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[440997,441010] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441144,441157] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441283,441296] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441446,441459] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441612,441625] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441776,441789] [2025-01-09 20:32:06,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[441941,441954] [2025-01-09 20:32:06,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442106,442119] [2025-01-09 20:32:06,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442272,442285] [2025-01-09 20:32:06,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442437,442450] [2025-01-09 20:32:06,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442604,442617] [2025-01-09 20:32:06,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442764,442777] [2025-01-09 20:32:06,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[442926,442939] [2025-01-09 20:32:06,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443085,443098] [2025-01-09 20:32:06,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443231,443244] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443374,443387] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443518,443531] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443661,443674] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443805,443818] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[443946,443959] [2025-01-09 20:32:06,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444084,444097] [2025-01-09 20:32:06,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444242,444255] [2025-01-09 20:32:06,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444401,444414] [2025-01-09 20:32:06,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444557,444570] [2025-01-09 20:32:06,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444706,444719] [2025-01-09 20:32:06,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[444858,444871] [2025-01-09 20:32:07,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445009,445022] [2025-01-09 20:32:07,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445158,445171] [2025-01-09 20:32:07,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445310,445323] [2025-01-09 20:32:07,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445458,445471] [2025-01-09 20:32:07,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445611,445624] [2025-01-09 20:32:07,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445762,445775] [2025-01-09 20:32:07,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[445912,445925] [2025-01-09 20:32:07,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446059,446072] [2025-01-09 20:32:07,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446210,446223] [2025-01-09 20:32:07,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446361,446374] [2025-01-09 20:32:07,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446509,446522] [2025-01-09 20:32:07,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446675,446688] [2025-01-09 20:32:07,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[446844,446857] [2025-01-09 20:32:07,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447011,447024] [2025-01-09 20:32:07,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447179,447192] [2025-01-09 20:32:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447329,447342] [2025-01-09 20:32:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447476,447489] [2025-01-09 20:32:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447637,447650] [2025-01-09 20:32:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447807,447820] [2025-01-09 20:32:07,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i[447969,447982] [2025-01-09 20:32:07,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:32:07,135 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:32:07,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07 WrapperNode [2025-01-09 20:32:07,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:32:07,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:32:07,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:32:07,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:32:07,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:07,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:07,338 INFO L138 Inliner]: procedures = 751, calls = 3543, calls flagged for inlining = 402, calls inlined = 238, statements flattened = 7395 [2025-01-09 20:32:07,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:32:07,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:32:07,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:32:07,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:32:07,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:07,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:07,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,419 INFO L175 MemorySlicer]: Split 1107 memory accesses to 23 slices as follows [23, 1, 2, 2, 3, 1, 5, 46, 2, 4, 1, 2, 12, 17, 905, 3, 7, 17, 2, 2, 2, 2, 46]. 82 percent of accesses are in the largest equivalence class. The 85 initializations are split as follows [23, 0, 0, 0, 3, 0, 5, 0, 0, 0, 1, 2, 12, 0, 32, 0, 7, 0, 0, 0, 0, 0, 0]. The 433 writes are split as follows [0, 0, 1, 0, 0, 0, 0, 46, 1, 1, 0, 0, 0, 17, 343, 3, 0, 17, 1, 1, 1, 1, 0]. [2025-01-09 20:32:08,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:32:08,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:32:08,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:32:08,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:32:08,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (1/1) ... [2025-01-09 20:32:08,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:32:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:32:08,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:32:08,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_delayed_work [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_delayed_work [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure u132_disable [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_disable [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure u132_remove [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_remove [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_init_kref [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_init_kref [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-01-09 20:32:08,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:32:08,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_put_kref [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_put_kref [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_read_pcimem [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_read_pcimem [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_requeue_work [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_requeue_work [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_suspend [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_suspend [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure u132_get_frame [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_get_frame [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure edset_output [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_output [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure read_roothub_info [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure read_roothub_info [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_scheduler_lock_of_u132 [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure edset_single [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_single [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure edset_setup [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure edset_setup [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-01-09 20:32:08,714 INFO L130 BoogieDeclarations]: Found specification of procedure u132_resume [2025-01-09 20:32:08,714 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_resume [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure ftdi_elan_gone_away [2025-01-09 20:32:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ftdi_elan_gone_away [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-09 20:32:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-09 20:32:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-01-09 20:32:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-01-09 20:32:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-01-09 20:32:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_cancel_work [2025-01-09 20:32:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_cancel_work [2025-01-09 20:32:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_unlink_urb_from_ep [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_unlink_urb_from_ep [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_ring_work_scheduler [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_ring_work_scheduler [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure u132_u132_put_kref [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_u132_put_kref [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_endp_work_scheduler [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_endp_work_scheduler [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-01-09 20:32:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-01-09 20:32:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:32:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-01-09 20:32:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_monitor_work [2025-01-09 20:32:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_monitor_work [2025-01-09 20:32:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:32:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure u132_monitor_requeue_work [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_monitor_requeue_work [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_stop [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_stop [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_giveback_urb [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_giveback_urb [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_write_pcimem [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_write_pcimem [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_queue_work [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_queue_work [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_u132_module_lock [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_queue_work [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_queue_work [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2025-01-09 20:32:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2025-01-09 20:32:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_start [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_start [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ftdi_elan_edset_input [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ftdi_elan_edset_input [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure u132_to_hcd [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_to_hcd [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure u132_probe [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_probe [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sw_lock_of_u132 [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_init_kref [2025-01-09 20:32:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_init_kref [2025-01-09 20:32:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-01-09 20:32:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_sw_lock_of_u132 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-01-09 20:32:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-01-09 20:32:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 20:32:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure u132_udev_get_kref [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_udev_get_kref [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure hcd_to_u132 [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure hcd_to_u132 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_giveback_urb [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_giveback_urb [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure u132_bus_resume [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_bus_resume [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_slock_of_u132_spin [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_delete [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_delete [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_platdata [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_platdata [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_put_kref [2025-01-09 20:32:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_put_kref [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 20:32:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 20:32:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 20:32:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 20:32:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-09 20:32:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_100 [2025-01-09 20:32:08,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_100 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 20:32:08,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_put_kref [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_put_kref [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure u132_endp_urb_dequeue [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_endp_urb_dequeue [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure u132_hcd_reset [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_hcd_reset [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure port_power [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure port_power [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:32:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 20:32:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 20:32:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:32:08,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_hcd_link_urb_to_ep [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_hcd_link_urb_to_ep [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_scheduler_lock_of_u132 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure u132_ring_cancel_work [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure u132_ring_cancel_work [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-01-09 20:32:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_u132_module_lock [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 20:32:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 20:32:09,507 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:32:09,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:32:09,565 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 20:32:18,813 INFO L? ?]: Removed 2727 outVars from TransFormulas that were not future-live. [2025-01-09 20:32:18,813 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:32:18,846 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:32:18,846 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 20:32:18,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:18 BoogieIcfgContainer [2025-01-09 20:32:18,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:32:18,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:32:18,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:32:18,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:32:18,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:32:04" (1/3) ... [2025-01-09 20:32:18,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3a47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:18, skipping insertion in model container [2025-01-09 20:32:18,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:32:07" (2/3) ... [2025-01-09 20:32:18,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3a47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:32:18, skipping insertion in model container [2025-01-09 20:32:18,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:32:18" (3/3) ... [2025-01-09 20:32:18,852 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i [2025-01-09 20:32:18,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:32:18,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---drivers--usb--host--u132-hcd.ko.cil.i that has 120 procedures, 2456 locations, 1 initial locations, 3 loop locations, and 29 error locations. [2025-01-09 20:32:18,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:32:18,955 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;@4502ee6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:32:18,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 20:32:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 2455 states, 1684 states have (on average 1.339667458432304) internal successors, (2256), 1776 states have internal predecessors, (2256), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) [2025-01-09 20:32:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 20:32:18,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:18,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:18,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 452178296, now seen corresponding path program 1 times [2025-01-09 20:32:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302714635] [2025-01-09 20:32:18,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:19,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 20:32:19,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 20:32:19,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:19,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302714635] [2025-01-09 20:32:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302714635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956966982] [2025-01-09 20:32:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:20,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:20,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:20,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:20,486 INFO L87 Difference]: Start difference. First operand has 2455 states, 1684 states have (on average 1.339667458432304) internal successors, (2256), 1776 states have internal predecessors, (2256), 623 states have call successors, (623), 119 states have call predecessors, (623), 118 states have return successors, (617), 585 states have call predecessors, (617), 617 states have call successors, (617) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:32:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:20,784 INFO L93 Difference]: Finished difference Result 4868 states and 7159 transitions. [2025-01-09 20:32:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:20,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-01-09 20:32:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:20,811 INFO L225 Difference]: With dead ends: 4868 [2025-01-09 20:32:20,811 INFO L226 Difference]: Without dead ends: 2435 [2025-01-09 20:32:20,824 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-01-09 20:32:20,825 INFO L435 NwaCegarLoop]: 3449 mSDtfsCounter, 3425 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3425 SdHoareTripleChecker+Valid, 6897 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:20,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3425 Valid, 6897 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-01-09 20:32:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2025-01-09 20:32:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 1673 states have (on average 1.3144052600119547) internal successors, (2199), 1760 states have internal predecessors, (2199), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3431 transitions. [2025-01-09 20:32:20,996 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3431 transitions. Word has length 61 [2025-01-09 20:32:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:20,998 INFO L471 AbstractCegarLoop]: Abstraction has 2435 states and 3431 transitions. [2025-01-09 20:32:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 20:32:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3431 transitions. [2025-01-09 20:32:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:32:21,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:21,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:21,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:32:21,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:21,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1022207397, now seen corresponding path program 1 times [2025-01-09 20:32:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:21,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747251817] [2025-01-09 20:32:21,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:21,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:21,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:32:21,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:32:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:21,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747251817] [2025-01-09 20:32:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747251817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431041631] [2025-01-09 20:32:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:22,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:22,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:22,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:22,292 INFO L87 Difference]: Start difference. First operand 2435 states and 3431 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:22,427 INFO L93 Difference]: Finished difference Result 2435 states and 3431 transitions. [2025-01-09 20:32:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 67 [2025-01-09 20:32:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:22,446 INFO L225 Difference]: With dead ends: 2435 [2025-01-09 20:32:22,446 INFO L226 Difference]: Without dead ends: 2433 [2025-01-09 20:32:22,447 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-01-09 20:32:22,449 INFO L435 NwaCegarLoop]: 3427 mSDtfsCounter, 3402 mSDsluCounter, 3426 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 6853 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:22,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 6853 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2025-01-09 20:32:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2433. [2025-01-09 20:32:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 1672 states have (on average 1.3139952153110048) internal successors, (2197), 1758 states have internal predecessors, (2197), 617 states have call successors, (617), 118 states have call predecessors, (617), 117 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3429 transitions. [2025-01-09 20:32:22,559 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3429 transitions. Word has length 67 [2025-01-09 20:32:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:22,560 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3429 transitions. [2025-01-09 20:32:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3429 transitions. [2025-01-09 20:32:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:32:22,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:22,562 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-09 20:32:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:32:22,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -217896060, now seen corresponding path program 1 times [2025-01-09 20:32:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937090009] [2025-01-09 20:32:22,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:23,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:32:23,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:32:23,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:23,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:32:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:23,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937090009] [2025-01-09 20:32:23,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937090009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:23,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406581958] [2025-01-09 20:32:23,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:23,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:23,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:23,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:23,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:23,840 INFO L87 Difference]: Start difference. First operand 2433 states and 3429 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:24,050 INFO L93 Difference]: Finished difference Result 2452 states and 3444 transitions. [2025-01-09 20:32:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:24,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2025-01-09 20:32:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:24,063 INFO L225 Difference]: With dead ends: 2452 [2025-01-09 20:32:24,063 INFO L226 Difference]: Without dead ends: 2450 [2025-01-09 20:32:24,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:24,066 INFO L435 NwaCegarLoop]: 3434 mSDtfsCounter, 3382 mSDsluCounter, 6893 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3383 SdHoareTripleChecker+Valid, 10327 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:24,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3383 Valid, 10327 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-01-09 20:32:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2448. [2025-01-09 20:32:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 1683 states have (on average 1.3125371360665479) internal successors, (2209), 1769 states have internal predecessors, (2209), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3441 transitions. [2025-01-09 20:32:24,140 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3441 transitions. Word has length 69 [2025-01-09 20:32:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:24,141 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3441 transitions. [2025-01-09 20:32:24,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 20:32:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3441 transitions. [2025-01-09 20:32:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 20:32:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:24,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:24,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:32:24,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2010929365, now seen corresponding path program 1 times [2025-01-09 20:32:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300672862] [2025-01-09 20:32:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 20:32:24,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 20:32:24,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300672862] [2025-01-09 20:32:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300672862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070716235] [2025-01-09 20:32:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:25,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:25,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:25,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:25,138 INFO L87 Difference]: Start difference. First operand 2448 states and 3441 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:25,268 INFO L93 Difference]: Finished difference Result 2448 states and 3441 transitions. [2025-01-09 20:32:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 73 [2025-01-09 20:32:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:25,278 INFO L225 Difference]: With dead ends: 2448 [2025-01-09 20:32:25,279 INFO L226 Difference]: Without dead ends: 2446 [2025-01-09 20:32:25,279 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-01-09 20:32:25,284 INFO L435 NwaCegarLoop]: 3425 mSDtfsCounter, 3399 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3399 SdHoareTripleChecker+Valid, 6849 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:25,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3399 Valid, 6849 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-01-09 20:32:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2446. [2025-01-09 20:32:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 1682 states have (on average 1.312128418549346) internal successors, (2207), 1767 states have internal predecessors, (2207), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 3439 transitions. [2025-01-09 20:32:25,386 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 3439 transitions. Word has length 73 [2025-01-09 20:32:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:25,386 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 3439 transitions. [2025-01-09 20:32:25,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 20:32:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3439 transitions. [2025-01-09 20:32:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 20:32:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:25,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:25,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:32:25,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:25,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:25,389 INFO L85 PathProgramCache]: Analyzing trace with hash 361820939, now seen corresponding path program 1 times [2025-01-09 20:32:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315593017] [2025-01-09 20:32:25,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 20:32:26,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 20:32:26,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:26,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315593017] [2025-01-09 20:32:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315593017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545837043] [2025-01-09 20:32:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:26,403 INFO L87 Difference]: Start difference. First operand 2446 states and 3439 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:26,493 INFO L93 Difference]: Finished difference Result 2446 states and 3439 transitions. [2025-01-09 20:32:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:26,493 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), 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 79 [2025-01-09 20:32:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:26,502 INFO L225 Difference]: With dead ends: 2446 [2025-01-09 20:32:26,502 INFO L226 Difference]: Without dead ends: 2444 [2025-01-09 20:32:26,503 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-01-09 20:32:26,504 INFO L435 NwaCegarLoop]: 3423 mSDtfsCounter, 3396 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 6845 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:26,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 6845 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-01-09 20:32:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2444. [2025-01-09 20:32:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1681 states have (on average 1.3117192147531231) internal successors, (2205), 1765 states have internal predecessors, (2205), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3437 transitions. [2025-01-09 20:32:26,610 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3437 transitions. Word has length 79 [2025-01-09 20:32:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:26,610 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3437 transitions. [2025-01-09 20:32:26,610 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), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 20:32:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3437 transitions. [2025-01-09 20:32:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 20:32:26,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:26,611 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-09 20:32:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:32:26,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1046899737, now seen corresponding path program 1 times [2025-01-09 20:32:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723767588] [2025-01-09 20:32:26,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:27,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 20:32:27,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 20:32:27,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:27,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:32:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723767588] [2025-01-09 20:32:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723767588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:27,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:27,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957621026] [2025-01-09 20:32:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:27,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:27,891 INFO L87 Difference]: Start difference. First operand 2444 states and 3437 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 20:32:31,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:32:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:32,134 INFO L93 Difference]: Finished difference Result 2446 states and 3438 transitions. [2025-01-09 20:32:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2025-01-09 20:32:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:32,145 INFO L225 Difference]: With dead ends: 2446 [2025-01-09 20:32:32,146 INFO L226 Difference]: Without dead ends: 2444 [2025-01-09 20:32:32,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:32,147 INFO L435 NwaCegarLoop]: 3424 mSDtfsCounter, 25 mSDsluCounter, 10245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13669 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:32,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13669 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 20:32:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2025-01-09 20:32:32,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2444. [2025-01-09 20:32:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1681 states have (on average 1.3111243307555027) internal successors, (2204), 1765 states have internal predecessors, (2204), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3436 transitions. [2025-01-09 20:32:32,230 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3436 transitions. Word has length 80 [2025-01-09 20:32:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3436 transitions. [2025-01-09 20:32:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 20:32:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3436 transitions. [2025-01-09 20:32:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:32:32,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:32,233 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:32,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:32:32,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:32,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 778134449, now seen corresponding path program 1 times [2025-01-09 20:32:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473179004] [2025-01-09 20:32:32,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:33,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:32:33,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:32:33,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:33,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473179004] [2025-01-09 20:32:33,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473179004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:33,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:33,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221122837] [2025-01-09 20:32:33,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:33,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:33,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:33,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:33,423 INFO L87 Difference]: Start difference. First operand 2444 states and 3436 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:33,515 INFO L93 Difference]: Finished difference Result 2444 states and 3436 transitions. [2025-01-09 20:32:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:33,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 85 [2025-01-09 20:32:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:33,524 INFO L225 Difference]: With dead ends: 2444 [2025-01-09 20:32:33,524 INFO L226 Difference]: Without dead ends: 2442 [2025-01-09 20:32:33,525 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-01-09 20:32:33,527 INFO L435 NwaCegarLoop]: 3421 mSDtfsCounter, 3393 mSDsluCounter, 3420 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3393 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:33,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3393 Valid, 6841 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-01-09 20:32:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2025-01-09 20:32:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1680 states have (on average 1.3107142857142857) internal successors, (2202), 1763 states have internal predecessors, (2202), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3434 transitions. [2025-01-09 20:32:33,612 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3434 transitions. Word has length 85 [2025-01-09 20:32:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:33,612 INFO L471 AbstractCegarLoop]: Abstraction has 2442 states and 3434 transitions. [2025-01-09 20:32:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 20:32:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3434 transitions. [2025-01-09 20:32:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 20:32:33,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:33,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:32:33,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1030773068, now seen corresponding path program 1 times [2025-01-09 20:32:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030404010] [2025-01-09 20:32:33,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:34,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 20:32:34,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 20:32:34,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:34,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030404010] [2025-01-09 20:32:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030404010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:34,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691271323] [2025-01-09 20:32:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:34,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:34,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:34,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:34,834 INFO L87 Difference]: Start difference. First operand 2442 states and 3434 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:34,988 INFO L93 Difference]: Finished difference Result 2442 states and 3434 transitions. [2025-01-09 20:32:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:34,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 91 [2025-01-09 20:32:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:35,000 INFO L225 Difference]: With dead ends: 2442 [2025-01-09 20:32:35,001 INFO L226 Difference]: Without dead ends: 2440 [2025-01-09 20:32:35,002 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-01-09 20:32:35,002 INFO L435 NwaCegarLoop]: 3419 mSDtfsCounter, 3390 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3390 SdHoareTripleChecker+Valid, 6837 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:35,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3390 Valid, 6837 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-01-09 20:32:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2440. [2025-01-09 20:32:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1679 states have (on average 1.3103037522334724) internal successors, (2200), 1761 states have internal predecessors, (2200), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3432 transitions. [2025-01-09 20:32:35,144 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3432 transitions. Word has length 91 [2025-01-09 20:32:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:35,144 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3432 transitions. [2025-01-09 20:32:35,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 20:32:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3432 transitions. [2025-01-09 20:32:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 20:32:35,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:35,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:35,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:32:35,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash 187291600, now seen corresponding path program 1 times [2025-01-09 20:32:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:35,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050017000] [2025-01-09 20:32:35,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:35,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:35,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 20:32:35,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 20:32:35,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:35,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050017000] [2025-01-09 20:32:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050017000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809138933] [2025-01-09 20:32:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:36,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:36,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:36,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:36,134 INFO L87 Difference]: Start difference. First operand 2440 states and 3432 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:36,229 INFO L93 Difference]: Finished difference Result 2440 states and 3432 transitions. [2025-01-09 20:32:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 97 [2025-01-09 20:32:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:36,239 INFO L225 Difference]: With dead ends: 2440 [2025-01-09 20:32:36,239 INFO L226 Difference]: Without dead ends: 2438 [2025-01-09 20:32:36,240 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-01-09 20:32:36,240 INFO L435 NwaCegarLoop]: 3417 mSDtfsCounter, 3387 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3387 SdHoareTripleChecker+Valid, 6833 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:36,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3387 Valid, 6833 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2025-01-09 20:32:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2438. [2025-01-09 20:32:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 1678 states have (on average 1.3098927294398093) internal successors, (2198), 1759 states have internal predecessors, (2198), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3430 transitions. [2025-01-09 20:32:36,327 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3430 transitions. Word has length 97 [2025-01-09 20:32:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 2438 states and 3430 transitions. [2025-01-09 20:32:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 20:32:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3430 transitions. [2025-01-09 20:32:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:32:36,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:36,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:36,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:32:36,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash -74220584, now seen corresponding path program 1 times [2025-01-09 20:32:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:36,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612792792] [2025-01-09 20:32:36,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:36,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:32:36,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:32:36,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:36,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612792792] [2025-01-09 20:32:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612792792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342457799] [2025-01-09 20:32:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:37,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:37,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:37,163 INFO L87 Difference]: Start difference. First operand 2438 states and 3430 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:37,305 INFO L93 Difference]: Finished difference Result 2438 states and 3430 transitions. [2025-01-09 20:32:37,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 103 [2025-01-09 20:32:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:37,320 INFO L225 Difference]: With dead ends: 2438 [2025-01-09 20:32:37,321 INFO L226 Difference]: Without dead ends: 2436 [2025-01-09 20:32:37,321 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-01-09 20:32:37,322 INFO L435 NwaCegarLoop]: 3415 mSDtfsCounter, 3384 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3384 SdHoareTripleChecker+Valid, 6829 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:37,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3384 Valid, 6829 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-01-09 20:32:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2025-01-09 20:32:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1677 states have (on average 1.3094812164579606) internal successors, (2196), 1757 states have internal predecessors, (2196), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3428 transitions. [2025-01-09 20:32:37,418 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3428 transitions. Word has length 103 [2025-01-09 20:32:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:37,418 INFO L471 AbstractCegarLoop]: Abstraction has 2436 states and 3428 transitions. [2025-01-09 20:32:37,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3428 transitions. [2025-01-09 20:32:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 20:32:37,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:37,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:37,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:32:37,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1688622459, now seen corresponding path program 1 times [2025-01-09 20:32:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519076461] [2025-01-09 20:32:37,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:38,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:32:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:32:38,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:38,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519076461] [2025-01-09 20:32:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519076461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:38,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:38,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778884181] [2025-01-09 20:32:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:38,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:38,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:38,423 INFO L87 Difference]: Start difference. First operand 2436 states and 3428 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:38,617 INFO L93 Difference]: Finished difference Result 2436 states and 3428 transitions. [2025-01-09 20:32:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:38,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 105 [2025-01-09 20:32:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:38,635 INFO L225 Difference]: With dead ends: 2436 [2025-01-09 20:32:38,636 INFO L226 Difference]: Without dead ends: 2434 [2025-01-09 20:32:38,638 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-01-09 20:32:38,638 INFO L435 NwaCegarLoop]: 3413 mSDtfsCounter, 3380 mSDsluCounter, 3412 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 6825 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:38,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 6825 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-01-09 20:32:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2025-01-09 20:32:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1676 states have (on average 1.3090692124105012) internal successors, (2194), 1755 states have internal predecessors, (2194), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3426 transitions. [2025-01-09 20:32:38,826 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3426 transitions. Word has length 105 [2025-01-09 20:32:38,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:38,826 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3426 transitions. [2025-01-09 20:32:38,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 20:32:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3426 transitions. [2025-01-09 20:32:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 20:32:38,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:38,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:38,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:32:38,829 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:38,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 517547477, now seen corresponding path program 1 times [2025-01-09 20:32:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327127733] [2025-01-09 20:32:38,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:39,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 20:32:39,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 20:32:39,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:39,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:39,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327127733] [2025-01-09 20:32:39,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327127733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316284239] [2025-01-09 20:32:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:39,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:39,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:39,949 INFO L87 Difference]: Start difference. First operand 2434 states and 3426 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:40,079 INFO L93 Difference]: Finished difference Result 2434 states and 3426 transitions. [2025-01-09 20:32:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 111 [2025-01-09 20:32:40,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:40,092 INFO L225 Difference]: With dead ends: 2434 [2025-01-09 20:32:40,092 INFO L226 Difference]: Without dead ends: 2432 [2025-01-09 20:32:40,093 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-01-09 20:32:40,094 INFO L435 NwaCegarLoop]: 3411 mSDtfsCounter, 3379 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3379 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:40,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3379 Valid, 6821 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2025-01-09 20:32:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2025-01-09 20:32:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 1675 states have (on average 1.3086567164179104) internal successors, (2192), 1753 states have internal predecessors, (2192), 617 states have call successors, (617), 122 states have call predecessors, (617), 121 states have return successors, (615), 583 states have call predecessors, (615), 615 states have call successors, (615) [2025-01-09 20:32:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3424 transitions. [2025-01-09 20:32:40,190 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3424 transitions. Word has length 111 [2025-01-09 20:32:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:40,192 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3424 transitions. [2025-01-09 20:32:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 20:32:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3424 transitions. [2025-01-09 20:32:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 20:32:40,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:40,195 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:40,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:32:40,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1921875003, now seen corresponding path program 1 times [2025-01-09 20:32:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:40,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784607179] [2025-01-09 20:32:40,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:40,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 20:32:40,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 20:32:40,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:40,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 20:32:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:40,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784607179] [2025-01-09 20:32:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784607179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776114766] [2025-01-09 20:32:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:40,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:40,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:40,982 INFO L87 Difference]: Start difference. First operand 2432 states and 3424 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:45,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:32:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:48,807 INFO L93 Difference]: Finished difference Result 4970 states and 6941 transitions. [2025-01-09 20:32:48,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2025-01-09 20:32:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:48,817 INFO L225 Difference]: With dead ends: 4970 [2025-01-09 20:32:48,817 INFO L226 Difference]: Without dead ends: 2568 [2025-01-09 20:32:48,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:48,825 INFO L435 NwaCegarLoop]: 3523 mSDtfsCounter, 3494 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3494 SdHoareTripleChecker+Valid, 5810 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:48,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3494 Valid, 5810 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1239 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 20:32:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2025-01-09 20:32:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2544. [2025-01-09 20:32:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1763 states have (on average 1.2983550765740215) internal successors, (2289), 1841 states have internal predecessors, (2289), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3523 transitions. [2025-01-09 20:32:48,940 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3523 transitions. Word has length 125 [2025-01-09 20:32:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:48,940 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 3523 transitions. [2025-01-09 20:32:48,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:48,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3523 transitions. [2025-01-09 20:32:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 20:32:48,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:48,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:32:48,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1594840933, now seen corresponding path program 1 times [2025-01-09 20:32:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537198790] [2025-01-09 20:32:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:49,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 20:32:49,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 20:32:49,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:49,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537198790] [2025-01-09 20:32:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537198790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573775275] [2025-01-09 20:32:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:49,725 INFO L87 Difference]: Start difference. First operand 2544 states and 3523 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:49,888 INFO L93 Difference]: Finished difference Result 2544 states and 3523 transitions. [2025-01-09 20:32:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:49,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 117 [2025-01-09 20:32:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:49,897 INFO L225 Difference]: With dead ends: 2544 [2025-01-09 20:32:49,897 INFO L226 Difference]: Without dead ends: 2542 [2025-01-09 20:32:49,898 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-01-09 20:32:49,898 INFO L435 NwaCegarLoop]: 3408 mSDtfsCounter, 3375 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3375 SdHoareTripleChecker+Valid, 6815 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:49,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3375 Valid, 6815 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-01-09 20:32:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2025-01-09 20:32:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1762 states have (on average 1.2973893303064699) internal successors, (2286), 1839 states have internal predecessors, (2286), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3520 transitions. [2025-01-09 20:32:50,004 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3520 transitions. Word has length 117 [2025-01-09 20:32:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:50,005 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 3520 transitions. [2025-01-09 20:32:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 20:32:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3520 transitions. [2025-01-09 20:32:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 20:32:50,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:50,007 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:32:50,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1242653025, now seen corresponding path program 1 times [2025-01-09 20:32:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46888535] [2025-01-09 20:32:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:50,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 20:32:50,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 20:32:50,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 20:32:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46888535] [2025-01-09 20:32:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46888535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:32:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763830168] [2025-01-09 20:32:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:50,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:50,766 INFO L87 Difference]: Start difference. First operand 2542 states and 3520 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:50,949 INFO L93 Difference]: Finished difference Result 5050 states and 6992 transitions. [2025-01-09 20:32:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 131 [2025-01-09 20:32:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:50,958 INFO L225 Difference]: With dead ends: 5050 [2025-01-09 20:32:50,958 INFO L226 Difference]: Without dead ends: 2538 [2025-01-09 20:32:50,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:32:50,964 INFO L435 NwaCegarLoop]: 3404 mSDtfsCounter, 3394 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3394 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:50,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3394 Valid, 3404 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2025-01-09 20:32:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2025-01-09 20:32:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1759 states have (on average 1.296759522455941) internal successors, (2281), 1835 states have internal predecessors, (2281), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3515 transitions. [2025-01-09 20:32:51,071 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3515 transitions. Word has length 131 [2025-01-09 20:32:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:51,071 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3515 transitions. [2025-01-09 20:32:51,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3515 transitions. [2025-01-09 20:32:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 20:32:51,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:51,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:51,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:32:51,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1584033098, now seen corresponding path program 1 times [2025-01-09 20:32:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629939509] [2025-01-09 20:32:51,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 20:32:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 20:32:51,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:51,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:51,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:51,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629939509] [2025-01-09 20:32:51,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629939509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:51,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:51,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:51,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942574938] [2025-01-09 20:32:51,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:51,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:51,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:51,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:51,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:51,887 INFO L87 Difference]: Start difference. First operand 2538 states and 3515 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:52,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:52,049 INFO L93 Difference]: Finished difference Result 2538 states and 3515 transitions. [2025-01-09 20:32:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 123 [2025-01-09 20:32:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:52,056 INFO L225 Difference]: With dead ends: 2538 [2025-01-09 20:32:52,056 INFO L226 Difference]: Without dead ends: 2536 [2025-01-09 20:32:52,057 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-01-09 20:32:52,058 INFO L435 NwaCegarLoop]: 3401 mSDtfsCounter, 3367 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:52,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 6801 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2025-01-09 20:32:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2025-01-09 20:32:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1758 states have (on average 1.2957906712172924) internal successors, (2278), 1833 states have internal predecessors, (2278), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3512 transitions. [2025-01-09 20:32:52,166 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3512 transitions. Word has length 123 [2025-01-09 20:32:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:52,167 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3512 transitions. [2025-01-09 20:32:52,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 20:32:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3512 transitions. [2025-01-09 20:32:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 20:32:52,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:52,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:32:52,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 415580816, now seen corresponding path program 1 times [2025-01-09 20:32:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:52,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279051530] [2025-01-09 20:32:52,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:52,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 20:32:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 20:32:52,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 20:32:52,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279051530] [2025-01-09 20:32:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279051530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:32:52,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706302477] [2025-01-09 20:32:52,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:32:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:32:52,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:32:52,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:32:54,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 20:32:54,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 20:32:54,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:54,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:54,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 20:32:54,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:32:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 20:32:55,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:32:55,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706302477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:55,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:32:55,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 20:32:55,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23153799] [2025-01-09 20:32:55,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:55,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:32:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:55,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:32:55,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:55,090 INFO L87 Difference]: Start difference. First operand 2536 states and 3512 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:55,241 INFO L93 Difference]: Finished difference Result 5038 states and 6976 transitions. [2025-01-09 20:32:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:32:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-01-09 20:32:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:55,251 INFO L225 Difference]: With dead ends: 5038 [2025-01-09 20:32:55,251 INFO L226 Difference]: Without dead ends: 2532 [2025-01-09 20:32:55,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 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-01-09 20:32:55,257 INFO L435 NwaCegarLoop]: 3397 mSDtfsCounter, 3368 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3368 SdHoareTripleChecker+Valid, 3397 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:55,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3368 Valid, 3397 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-01-09 20:32:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2532. [2025-01-09 20:32:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 1755 states have (on average 1.295156695156695) internal successors, (2273), 1829 states have internal predecessors, (2273), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3507 transitions. [2025-01-09 20:32:55,373 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3507 transitions. Word has length 137 [2025-01-09 20:32:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:55,374 INFO L471 AbstractCegarLoop]: Abstraction has 2532 states and 3507 transitions. [2025-01-09 20:32:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3507 transitions. [2025-01-09 20:32:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 20:32:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:55,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:55,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:32:55,580 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,SelfDestructingSolverStorable16 [2025-01-09 20:32:55,580 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash -589811715, now seen corresponding path program 1 times [2025-01-09 20:32:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292468488] [2025-01-09 20:32:55,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:56,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 20:32:56,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 20:32:56,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:56,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292468488] [2025-01-09 20:32:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292468488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:56,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135767090] [2025-01-09 20:32:56,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:56,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:56,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:56,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:56,376 INFO L87 Difference]: Start difference. First operand 2532 states and 3507 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:56,504 INFO L93 Difference]: Finished difference Result 2532 states and 3507 transitions. [2025-01-09 20:32:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:56,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 129 [2025-01-09 20:32:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:56,511 INFO L225 Difference]: With dead ends: 2532 [2025-01-09 20:32:56,511 INFO L226 Difference]: Without dead ends: 2530 [2025-01-09 20:32:56,512 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-01-09 20:32:56,512 INFO L435 NwaCegarLoop]: 3394 mSDtfsCounter, 3359 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3359 SdHoareTripleChecker+Valid, 6787 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:56,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3359 Valid, 6787 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2025-01-09 20:32:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2025-01-09 20:32:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 1754 states have (on average 1.2941847206385404) internal successors, (2270), 1827 states have internal predecessors, (2270), 618 states have call successors, (618), 145 states have call predecessors, (618), 144 states have return successors, (616), 584 states have call predecessors, (616), 616 states have call successors, (616) [2025-01-09 20:32:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3504 transitions. [2025-01-09 20:32:56,629 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3504 transitions. Word has length 129 [2025-01-09 20:32:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:56,629 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3504 transitions. [2025-01-09 20:32:56,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 20:32:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3504 transitions. [2025-01-09 20:32:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 20:32:56,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:56,632 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-09 20:32:56,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:32:56,632 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:56,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -894655809, now seen corresponding path program 1 times [2025-01-09 20:32:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045034547] [2025-01-09 20:32:56,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:57,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 20:32:57,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 20:32:57,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:57,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-09 20:32:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045034547] [2025-01-09 20:32:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045034547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:57,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:57,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:32:57,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191943959] [2025-01-09 20:32:57,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:57,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:32:57,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:57,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:32:57,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:32:57,745 INFO L87 Difference]: Start difference. First operand 2530 states and 3504 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:57,974 INFO L93 Difference]: Finished difference Result 3036 states and 4194 transitions. [2025-01-09 20:32:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:32:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-01-09 20:32:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:57,990 INFO L225 Difference]: With dead ends: 3036 [2025-01-09 20:32:57,990 INFO L226 Difference]: Without dead ends: 3034 [2025-01-09 20:32:57,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:32:57,993 INFO L435 NwaCegarLoop]: 3503 mSDtfsCounter, 2521 mSDsluCounter, 8481 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 11984 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:57,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2522 Valid, 11984 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2025-01-09 20:32:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 3024. [2025-01-09 20:32:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 2054 states have (on average 1.2833495618305746) internal successors, (2636), 2164 states have internal predecessors, (2636), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:32:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 4186 transitions. [2025-01-09 20:32:58,327 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 4186 transitions. Word has length 178 [2025-01-09 20:32:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 3024 states and 4186 transitions. [2025-01-09 20:32:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 4186 transitions. [2025-01-09 20:32:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 20:32:58,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:58,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:32:58,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1714330042, now seen corresponding path program 1 times [2025-01-09 20:32:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380424854] [2025-01-09 20:32:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:32:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 20:32:58,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 20:32:58,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:32:58,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:32:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:32:59,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:32:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380424854] [2025-01-09 20:32:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380424854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:32:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:32:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:32:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200332380] [2025-01-09 20:32:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:32:59,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:32:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:32:59,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:32:59,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:32:59,114 INFO L87 Difference]: Start difference. First operand 3024 states and 4186 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:32:59,304 INFO L93 Difference]: Finished difference Result 3024 states and 4186 transitions. [2025-01-09 20:32:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:32:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 135 [2025-01-09 20:32:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:32:59,313 INFO L225 Difference]: With dead ends: 3024 [2025-01-09 20:32:59,313 INFO L226 Difference]: Without dead ends: 3022 [2025-01-09 20:32:59,314 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-01-09 20:32:59,314 INFO L435 NwaCegarLoop]: 3392 mSDtfsCounter, 3356 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3356 SdHoareTripleChecker+Valid, 6783 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:32:59,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3356 Valid, 6783 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:32:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2025-01-09 20:32:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2025-01-09 20:32:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2053 states have (on average 1.282513395031661) internal successors, (2633), 2162 states have internal predecessors, (2633), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:32:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4183 transitions. [2025-01-09 20:32:59,469 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4183 transitions. Word has length 135 [2025-01-09 20:32:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:32:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 4183 transitions. [2025-01-09 20:32:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 20:32:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4183 transitions. [2025-01-09 20:32:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:32:59,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:32:59,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:32:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:32:59,472 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:32:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:32:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1709298651, now seen corresponding path program 1 times [2025-01-09 20:32:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:32:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768247915] [2025-01-09 20:32:59,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:32:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:00,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 20:33:00,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 20:33:00,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:00,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:00,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768247915] [2025-01-09 20:33:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768247915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:00,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483832528] [2025-01-09 20:33:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:00,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:00,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:00,298 INFO L87 Difference]: Start difference. First operand 3022 states and 4183 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:33:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:00,512 INFO L93 Difference]: Finished difference Result 3022 states and 4183 transitions. [2025-01-09 20:33:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 141 [2025-01-09 20:33:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:00,521 INFO L225 Difference]: With dead ends: 3022 [2025-01-09 20:33:00,522 INFO L226 Difference]: Without dead ends: 3020 [2025-01-09 20:33:00,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-01-09 20:33:00,523 INFO L435 NwaCegarLoop]: 3390 mSDtfsCounter, 3353 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3353 SdHoareTripleChecker+Valid, 6779 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:00,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3353 Valid, 6779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2025-01-09 20:33:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 3020. [2025-01-09 20:33:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2052 states have (on average 1.2816764132553606) internal successors, (2630), 2160 states have internal predecessors, (2630), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:33:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4180 transitions. [2025-01-09 20:33:00,690 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4180 transitions. Word has length 141 [2025-01-09 20:33:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 4180 transitions. [2025-01-09 20:33:00,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 20:33:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4180 transitions. [2025-01-09 20:33:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 20:33:00,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:00,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:33:00,693 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:00,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -322716371, now seen corresponding path program 1 times [2025-01-09 20:33:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107584676] [2025-01-09 20:33:00,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:01,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 20:33:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 20:33:01,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:01,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:01,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107584676] [2025-01-09 20:33:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107584676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956546618] [2025-01-09 20:33:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:01,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:01,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:01,557 INFO L87 Difference]: Start difference. First operand 3020 states and 4180 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:01,738 INFO L93 Difference]: Finished difference Result 3020 states and 4180 transitions. [2025-01-09 20:33:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 147 [2025-01-09 20:33:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:01,747 INFO L225 Difference]: With dead ends: 3020 [2025-01-09 20:33:01,747 INFO L226 Difference]: Without dead ends: 3018 [2025-01-09 20:33:01,749 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-01-09 20:33:01,750 INFO L435 NwaCegarLoop]: 3388 mSDtfsCounter, 3350 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 6775 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:01,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 6775 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-01-09 20:33:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3018. [2025-01-09 20:33:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3018 states, 2051 states have (on average 1.280838615309605) internal successors, (2627), 2158 states have internal predecessors, (2627), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:33:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4177 transitions. [2025-01-09 20:33:01,971 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4177 transitions. Word has length 147 [2025-01-09 20:33:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:01,972 INFO L471 AbstractCegarLoop]: Abstraction has 3018 states and 4177 transitions. [2025-01-09 20:33:01,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 20:33:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4177 transitions. [2025-01-09 20:33:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 20:33:01,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:01,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:01,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:33:01,974 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:01,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 294988780, now seen corresponding path program 1 times [2025-01-09 20:33:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244619150] [2025-01-09 20:33:01,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:02,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 20:33:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 20:33:02,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:02,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244619150] [2025-01-09 20:33:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244619150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:02,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799322443] [2025-01-09 20:33:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:02,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:02,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:02,745 INFO L87 Difference]: Start difference. First operand 3018 states and 4177 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:02,934 INFO L93 Difference]: Finished difference Result 3018 states and 4177 transitions. [2025-01-09 20:33:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 153 [2025-01-09 20:33:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:02,945 INFO L225 Difference]: With dead ends: 3018 [2025-01-09 20:33:02,945 INFO L226 Difference]: Without dead ends: 3016 [2025-01-09 20:33:02,946 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-01-09 20:33:02,946 INFO L435 NwaCegarLoop]: 3386 mSDtfsCounter, 3347 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3347 SdHoareTripleChecker+Valid, 6771 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:02,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3347 Valid, 6771 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2025-01-09 20:33:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2025-01-09 20:33:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 2050 states have (on average 1.28) internal successors, (2624), 2156 states have internal predecessors, (2624), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:33:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 4174 transitions. [2025-01-09 20:33:03,198 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 4174 transitions. Word has length 153 [2025-01-09 20:33:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:03,199 INFO L471 AbstractCegarLoop]: Abstraction has 3016 states and 4174 transitions. [2025-01-09 20:33:03,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 20:33:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 4174 transitions. [2025-01-09 20:33:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 20:33:03,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:03,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 20:33:03,201 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:03,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:03,202 INFO L85 PathProgramCache]: Analyzing trace with hash -544823013, now seen corresponding path program 1 times [2025-01-09 20:33:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143732112] [2025-01-09 20:33:03,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 20:33:03,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 20:33:03,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:03,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143732112] [2025-01-09 20:33:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143732112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862001803] [2025-01-09 20:33:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:03,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:03,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:03,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:03,971 INFO L87 Difference]: Start difference. First operand 3016 states and 4174 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:04,159 INFO L93 Difference]: Finished difference Result 3016 states and 4174 transitions. [2025-01-09 20:33:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:04,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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 159 [2025-01-09 20:33:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:04,171 INFO L225 Difference]: With dead ends: 3016 [2025-01-09 20:33:04,171 INFO L226 Difference]: Without dead ends: 3014 [2025-01-09 20:33:04,172 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-01-09 20:33:04,172 INFO L435 NwaCegarLoop]: 3384 mSDtfsCounter, 3344 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3344 SdHoareTripleChecker+Valid, 6767 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:04,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3344 Valid, 6767 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2025-01-09 20:33:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3014. [2025-01-09 20:33:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 2049 states have (on average 1.2791605661298193) internal successors, (2621), 2154 states have internal predecessors, (2621), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:33:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 4171 transitions. [2025-01-09 20:33:04,411 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 4171 transitions. Word has length 159 [2025-01-09 20:33:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:04,412 INFO L471 AbstractCegarLoop]: Abstraction has 3014 states and 4171 transitions. [2025-01-09 20:33:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 20:33:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 4171 transitions. [2025-01-09 20:33:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 20:33:04,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:04,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:04,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 20:33:04,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:04,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash -874253303, now seen corresponding path program 1 times [2025-01-09 20:33:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:04,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302007259] [2025-01-09 20:33:04,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:04,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 20:33:05,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 20:33:05,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:05,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302007259] [2025-01-09 20:33:05,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302007259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:05,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:05,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206500053] [2025-01-09 20:33:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:05,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:05,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:05,209 INFO L87 Difference]: Start difference. First operand 3014 states and 4171 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:05,418 INFO L93 Difference]: Finished difference Result 3014 states and 4171 transitions. [2025-01-09 20:33:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 165 [2025-01-09 20:33:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:05,435 INFO L225 Difference]: With dead ends: 3014 [2025-01-09 20:33:05,435 INFO L226 Difference]: Without dead ends: 3012 [2025-01-09 20:33:05,436 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-01-09 20:33:05,436 INFO L435 NwaCegarLoop]: 3382 mSDtfsCounter, 3341 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3341 SdHoareTripleChecker+Valid, 6763 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:05,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3341 Valid, 6763 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-01-09 20:33:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 3012. [2025-01-09 20:33:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 2048 states have (on average 1.2783203125) internal successors, (2618), 2152 states have internal predecessors, (2618), 751 states have call successors, (751), 207 states have call predecessors, (751), 205 states have return successors, (799), 689 states have call predecessors, (799), 749 states have call successors, (799) [2025-01-09 20:33:05,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 4168 transitions. [2025-01-09 20:33:05,747 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 4168 transitions. Word has length 165 [2025-01-09 20:33:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:05,747 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 4168 transitions. [2025-01-09 20:33:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 4168 transitions. [2025-01-09 20:33:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 20:33:05,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:05,751 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:05,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 20:33:05,751 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:05,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 222623317, now seen corresponding path program 1 times [2025-01-09 20:33:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:05,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663464161] [2025-01-09 20:33:05,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 20:33:06,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 20:33:06,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:06,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-01-09 20:33:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663464161] [2025-01-09 20:33:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663464161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:06,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:06,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:33:06,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80628790] [2025-01-09 20:33:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:06,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:33:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:06,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:33:06,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:06,847 INFO L87 Difference]: Start difference. First operand 3012 states and 4168 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:07,095 INFO L93 Difference]: Finished difference Result 3140 states and 4292 transitions. [2025-01-09 20:33:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:33:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 215 [2025-01-09 20:33:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:07,103 INFO L225 Difference]: With dead ends: 3140 [2025-01-09 20:33:07,103 INFO L226 Difference]: Without dead ends: 3138 [2025-01-09 20:33:07,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:33:07,104 INFO L435 NwaCegarLoop]: 3391 mSDtfsCounter, 2840 mSDsluCounter, 7378 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 10769 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:07,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 10769 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:07,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2025-01-09 20:33:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3134. [2025-01-09 20:33:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 2130 states have (on average 1.2708920187793427) internal successors, (2707), 2235 states have internal predecessors, (2707), 766 states have call successors, (766), 233 states have call predecessors, (766), 231 states have return successors, (814), 704 states have call predecessors, (814), 764 states have call successors, (814) [2025-01-09 20:33:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 4287 transitions. [2025-01-09 20:33:07,310 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 4287 transitions. Word has length 215 [2025-01-09 20:33:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:07,311 INFO L471 AbstractCegarLoop]: Abstraction has 3134 states and 4287 transitions. [2025-01-09 20:33:07,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (29), 3 states have call predecessors, (29), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 20:33:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 4287 transitions. [2025-01-09 20:33:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 20:33:07,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:07,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 20:33:07,313 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:07,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -647364949, now seen corresponding path program 1 times [2025-01-09 20:33:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953594437] [2025-01-09 20:33:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:07,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 20:33:08,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 20:33:08,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:08,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953594437] [2025-01-09 20:33:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953594437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787247508] [2025-01-09 20:33:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:08,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:08,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:08,202 INFO L87 Difference]: Start difference. First operand 3134 states and 4287 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:33:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:08,422 INFO L93 Difference]: Finished difference Result 3134 states and 4287 transitions. [2025-01-09 20:33:08,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 171 [2025-01-09 20:33:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:08,431 INFO L225 Difference]: With dead ends: 3134 [2025-01-09 20:33:08,431 INFO L226 Difference]: Without dead ends: 3132 [2025-01-09 20:33:08,432 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-01-09 20:33:08,432 INFO L435 NwaCegarLoop]: 3378 mSDtfsCounter, 3336 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:08,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 6755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2025-01-09 20:33:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3132. [2025-01-09 20:33:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2129 states have (on average 1.2700798496946923) internal successors, (2704), 2233 states have internal predecessors, (2704), 766 states have call successors, (766), 233 states have call predecessors, (766), 231 states have return successors, (814), 704 states have call predecessors, (814), 764 states have call successors, (814) [2025-01-09 20:33:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 4284 transitions. [2025-01-09 20:33:08,644 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 4284 transitions. Word has length 171 [2025-01-09 20:33:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 4284 transitions. [2025-01-09 20:33:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 20:33:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 4284 transitions. [2025-01-09 20:33:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 20:33:08,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:08,647 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:08,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 20:33:08,647 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2090901284, now seen corresponding path program 1 times [2025-01-09 20:33:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607318788] [2025-01-09 20:33:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:09,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 20:33:09,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 20:33:09,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:09,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-09 20:33:09,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:09,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607318788] [2025-01-09 20:33:09,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607318788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:09,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:09,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:33:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347865582] [2025-01-09 20:33:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:09,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:33:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:09,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:33:09,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:09,730 INFO L87 Difference]: Start difference. First operand 3132 states and 4284 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 20:33:13,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 20:33:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:14,083 INFO L93 Difference]: Finished difference Result 3146 states and 4294 transitions. [2025-01-09 20:33:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:33:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 218 [2025-01-09 20:33:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:14,090 INFO L225 Difference]: With dead ends: 3146 [2025-01-09 20:33:14,090 INFO L226 Difference]: Without dead ends: 3144 [2025-01-09 20:33:14,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:33:14,091 INFO L435 NwaCegarLoop]: 3908 mSDtfsCounter, 1474 mSDsluCounter, 10356 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 14264 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:14,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 14264 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 20:33:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-01-09 20:33:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 3136. [2025-01-09 20:33:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 2132 states have (on average 1.2696998123827392) internal successors, (2707), 2236 states have internal predecessors, (2707), 766 states have call successors, (766), 234 states have call predecessors, (766), 232 states have return successors, (814), 704 states have call predecessors, (814), 764 states have call successors, (814) [2025-01-09 20:33:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4287 transitions. [2025-01-09 20:33:14,304 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4287 transitions. Word has length 218 [2025-01-09 20:33:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:14,305 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 4287 transitions. [2025-01-09 20:33:14,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 20:33:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4287 transitions. [2025-01-09 20:33:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 20:33:14,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:14,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:14,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 20:33:14,308 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -50159640, now seen corresponding path program 1 times [2025-01-09 20:33:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:14,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341271085] [2025-01-09 20:33:14,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:14,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 20:33:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 20:33:14,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:15,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 20:33:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341271085] [2025-01-09 20:33:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341271085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:15,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:33:15,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363881016] [2025-01-09 20:33:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:15,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:33:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:15,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:33:15,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:33:15,100 INFO L87 Difference]: Start difference. First operand 3136 states and 4287 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 20:33:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:15,320 INFO L93 Difference]: Finished difference Result 3136 states and 4287 transitions. [2025-01-09 20:33:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:33:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 177 [2025-01-09 20:33:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:15,327 INFO L225 Difference]: With dead ends: 3136 [2025-01-09 20:33:15,327 INFO L226 Difference]: Without dead ends: 2827 [2025-01-09 20:33:15,330 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-01-09 20:33:15,334 INFO L435 NwaCegarLoop]: 3377 mSDtfsCounter, 3333 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:15,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 6754 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-01-09 20:33:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2025-01-09 20:33:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 1918 states have (on average 1.2956204379562044) internal successors, (2485), 2019 states have internal predecessors, (2485), 714 states have call successors, (714), 191 states have call predecessors, (714), 190 states have return successors, (764), 654 states have call predecessors, (764), 714 states have call successors, (764) [2025-01-09 20:33:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3963 transitions. [2025-01-09 20:33:15,534 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3963 transitions. Word has length 177 [2025-01-09 20:33:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:15,535 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 3963 transitions. [2025-01-09 20:33:15,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-01-09 20:33:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3963 transitions. [2025-01-09 20:33:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 20:33:15,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:15,538 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:15,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 20:33:15,539 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:15,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1724277628, now seen corresponding path program 1 times [2025-01-09 20:33:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977650075] [2025-01-09 20:33:15,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:16,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 20:33:16,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 20:33:16,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:16,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-01-09 20:33:16,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:16,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977650075] [2025-01-09 20:33:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977650075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:16,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:33:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698073283] [2025-01-09 20:33:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:33:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:33:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:16,677 INFO L87 Difference]: Start difference. First operand 2827 states and 3963 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 20:33:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:33:16,923 INFO L93 Difference]: Finished difference Result 5151 states and 7233 transitions. [2025-01-09 20:33:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:33:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 235 [2025-01-09 20:33:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:33:16,930 INFO L225 Difference]: With dead ends: 5151 [2025-01-09 20:33:16,930 INFO L226 Difference]: Without dead ends: 2830 [2025-01-09 20:33:16,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:33:16,936 INFO L435 NwaCegarLoop]: 3143 mSDtfsCounter, 0 mSDsluCounter, 9421 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12564 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:33:16,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12564 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:33:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2025-01-09 20:33:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2025-01-09 20:33:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 1921 states have (on average 1.2951587714731911) internal successors, (2488), 2022 states have internal predecessors, (2488), 714 states have call successors, (714), 191 states have call predecessors, (714), 190 states have return successors, (764), 654 states have call predecessors, (764), 714 states have call successors, (764) [2025-01-09 20:33:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3966 transitions. [2025-01-09 20:33:17,144 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3966 transitions. Word has length 235 [2025-01-09 20:33:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:33:17,144 INFO L471 AbstractCegarLoop]: Abstraction has 2830 states and 3966 transitions. [2025-01-09 20:33:17,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 20:33:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3966 transitions. [2025-01-09 20:33:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 20:33:17,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:33:17,147 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:33:17,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 20:33:17,148 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2025-01-09 20:33:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:33:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1666724236, now seen corresponding path program 1 times [2025-01-09 20:33:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:33:17,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780308564] [2025-01-09 20:33:17,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:33:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:33:17,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 20:33:17,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 20:33:17,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:33:17,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:33:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-01-09 20:33:18,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:33:18,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780308564] [2025-01-09 20:33:18,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780308564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:33:18,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:33:18,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:33:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995216386] [2025-01-09 20:33:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:33:18,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:33:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:33:18,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:33:18,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:33:18,610 INFO L87 Difference]: Start difference. First operand 2830 states and 3966 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28)