./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:07:27,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:07:27,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 21:07:27,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:07:27,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:07:27,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:07:27,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:07:27,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:07:27,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:07:27,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:07:27,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:07:27,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:07:27,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:07:27,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:07:27,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:07:27,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:07:27,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:07:27,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:07:27,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:07:27,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:07:27,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:07:27,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:07:27,172 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13180db7de3a8489ee06ea96825d5be5d06449dd3c867f58676a7914255b860c [2025-03-08 21:07:27,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:07:27,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:07:27,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:07:27,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:07:27,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:07:27,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-08 21:07:28,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ad884fa/c63061de9a434232a401ef25e50f2829/FLAGb12134c20 [2025-03-08 21:07:29,033 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:07:29,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-08 21:07:29,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ad884fa/c63061de9a434232a401ef25e50f2829/FLAGb12134c20 [2025-03-08 21:07:29,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ad884fa/c63061de9a434232a401ef25e50f2829 [2025-03-08 21:07:29,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:07:29,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:07:29,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:07:29,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:07:29,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:07:29,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:07:29" (1/1) ... [2025-03-08 21:07:29,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556e7817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:29, skipping insertion in model container [2025-03-08 21:07:29,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:07:29" (1/1) ... [2025-03-08 21:07:29,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:07:32,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-03-08 21:07:32,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-03-08 21:07:32,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-03-08 21:07:32,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-03-08 21:07:32,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-03-08 21:07:32,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-03-08 21:07:32,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-03-08 21:07:32,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-03-08 21:07:32,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-03-08 21:07:32,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-03-08 21:07:32,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-03-08 21:07:32,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-03-08 21:07:32,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-03-08 21:07:32,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-03-08 21:07:32,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-03-08 21:07:32,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-03-08 21:07:32,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-03-08 21:07:32,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-03-08 21:07:32,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-03-08 21:07:32,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-03-08 21:07:32,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-03-08 21:07:32,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-03-08 21:07:32,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-03-08 21:07:32,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-03-08 21:07:32,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-03-08 21:07:32,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-03-08 21:07:32,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-03-08 21:07:32,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-03-08 21:07:32,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-03-08 21:07:32,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-03-08 21:07:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-03-08 21:07:32,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-03-08 21:07:32,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-03-08 21:07:32,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-03-08 21:07:32,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-03-08 21:07:32,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-03-08 21:07:32,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-03-08 21:07:32,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-03-08 21:07:32,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-03-08 21:07:32,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-03-08 21:07:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-03-08 21:07:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-03-08 21:07:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-03-08 21:07:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-03-08 21:07:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-03-08 21:07:32,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-03-08 21:07:32,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-03-08 21:07:32,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-03-08 21:07:32,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-03-08 21:07:32,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-03-08 21:07:32,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-03-08 21:07:32,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-03-08 21:07:32,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-03-08 21:07:32,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-03-08 21:07:32,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:07:32,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:07:32,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgb %2,%1": "=a" (__ret), "+m" (*__ptr): "q" (__new), "0" (__old): "memory"); [7080-7081] [2025-03-08 21:07:32,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgw %2,%1": "=a" (__ret), "+m" (*__ptr___0): "r" (__new), "0" (__old): "memory"); [7085-7086] [2025-03-08 21:07:32,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgl %2,%1": "=a" (__ret), "+m" (*__ptr___1): "r" (__new), "0" (__old): "memory"); [7090-7091] [2025-03-08 21:07:32,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; cmpxchgq %2,%1": "=a" (__ret), "+m" (*__ptr___2): "r" (__new), "0" (__old): "memory"); [7095-7096] [2025-03-08 21:07:32,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7547-7548] [2025-03-08 21:07:32,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (41), "i" (12UL)); [7557-7558] [2025-03-08 21:07:32,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/net/netns/generic.h"), "i" (45), "i" (12UL)); [7571-7572] [2025-03-08 21:07:32,525 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 *)"net/netfilter/nfnetlink_log.c"), "i" (581), "i" (12UL)); [8504-8505] [2025-03-08 21:07:32,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400642,400655] [2025-03-08 21:07:32,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400787,400800] [2025-03-08 21:07:32,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[400933,400946] [2025-03-08 21:07:32,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401098,401111] [2025-03-08 21:07:32,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401256,401269] [2025-03-08 21:07:32,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401414,401427] [2025-03-08 21:07:32,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401572,401585] [2025-03-08 21:07:32,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401732,401745] [2025-03-08 21:07:32,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[401891,401904] [2025-03-08 21:07:32,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402030,402043] [2025-03-08 21:07:32,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402172,402185] [2025-03-08 21:07:32,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402321,402334] [2025-03-08 21:07:32,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402460,402473] [2025-03-08 21:07:32,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402615,402628] [2025-03-08 21:07:32,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402775,402788] [2025-03-08 21:07:32,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[402926,402939] [2025-03-08 21:07:32,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403077,403090] [2025-03-08 21:07:32,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403229,403242] [2025-03-08 21:07:32,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403378,403391] [2025-03-08 21:07:32,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403526,403539] [2025-03-08 21:07:32,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403683,403696] [2025-03-08 21:07:32,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403832,403845] [2025-03-08 21:07:32,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[403988,404001] [2025-03-08 21:07:32,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404141,404154] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404287,404300] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404430,404443] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404582,404595] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404728,404741] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[404873,404886] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405027,405040] [2025-03-08 21:07:32,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405178,405191] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405333,405346] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405485,405498] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405640,405653] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405804,405817] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[405960,405973] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406124,406137] [2025-03-08 21:07:32,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406266,406279] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406424,406437] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406591,406604] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406750,406763] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[406909,406922] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407058,407071] [2025-03-08 21:07:32,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407205,407218] [2025-03-08 21:07:32,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407344,407357] [2025-03-08 21:07:32,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407507,407520] [2025-03-08 21:07:32,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407673,407686] [2025-03-08 21:07:32,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[407837,407850] [2025-03-08 21:07:32,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408002,408015] [2025-03-08 21:07:32,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408167,408180] [2025-03-08 21:07:32,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408333,408346] [2025-03-08 21:07:32,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408498,408511] [2025-03-08 21:07:32,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408665,408678] [2025-03-08 21:07:32,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408825,408838] [2025-03-08 21:07:32,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[408987,409000] [2025-03-08 21:07:32,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409146,409159] [2025-03-08 21:07:32,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409292,409305] [2025-03-08 21:07:32,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409435,409448] [2025-03-08 21:07:32,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409579,409592] [2025-03-08 21:07:32,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409722,409735] [2025-03-08 21:07:32,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[409866,409879] [2025-03-08 21:07:32,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410007,410020] [2025-03-08 21:07:32,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410145,410158] [2025-03-08 21:07:32,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410303,410316] [2025-03-08 21:07:32,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410462,410475] [2025-03-08 21:07:32,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410618,410631] [2025-03-08 21:07:32,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410767,410780] [2025-03-08 21:07:32,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[410919,410932] [2025-03-08 21:07:32,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411070,411083] [2025-03-08 21:07:32,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411219,411232] [2025-03-08 21:07:32,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411371,411384] [2025-03-08 21:07:32,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411519,411532] [2025-03-08 21:07:32,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411672,411685] [2025-03-08 21:07:32,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411823,411836] [2025-03-08 21:07:32,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[411973,411986] [2025-03-08 21:07:32,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412120,412133] [2025-03-08 21:07:32,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412271,412284] [2025-03-08 21:07:32,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412422,412435] [2025-03-08 21:07:32,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412570,412583] [2025-03-08 21:07:32,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412736,412749] [2025-03-08 21:07:32,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[412905,412918] [2025-03-08 21:07:32,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413072,413085] [2025-03-08 21:07:32,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413240,413253] [2025-03-08 21:07:32,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413390,413403] [2025-03-08 21:07:32,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413537,413550] [2025-03-08 21:07:32,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413698,413711] [2025-03-08 21:07:32,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[413868,413881] [2025-03-08 21:07:32,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i[414030,414043] [2025-03-08 21:07:32,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:07:32,763 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __cmpxchg_wrong_size [2025-03-08 21:07:32,769 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:07:32,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32 WrapperNode [2025-03-08 21:07:32,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:07:32,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:07:32,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:07:32,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:07:32,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:32,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:32,926 INFO L138 Inliner]: procedures = 618, calls = 1465, calls flagged for inlining = 276, calls inlined = 181, statements flattened = 2717 [2025-03-08 21:07:32,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:07:32,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:07:32,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:07:32,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:07:32,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:32,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:32,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,245 INFO L175 MemorySlicer]: Split 248 memory accesses to 24 slices as follows [8, 16, 6, 4, 103, 31, 1, 7, 1, 3, 4, 12, 1, 1, 10, 1, 2, 3, 1, 4, 19, 4, 2, 4]. 42 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [0, 4, 6, 4, 4, 0, 0, 7, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 4, 0, 4, 0, 0]. The 112 writes are split as follows [0, 12, 0, 0, 47, 31, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 19, 0, 0, 0]. [2025-03-08 21:07:33,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:07:33,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:07:33,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:07:33,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:07:33,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (1/1) ... [2025-03-08 21:07:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:07:33,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:07:33,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:07:33,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:07:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2025-03-08 21:07:33,423 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2025-03-08 21:07:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:07:33,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-08 21:07:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2025-03-08 21:07:33,423 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2025-03-08 21:07:33,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2025-03-08 21:07:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2025-03-08 21:07:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 21:07:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 21:07:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-08 21:07:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-08 21:07:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2025-03-08 21:07:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:07:33,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-08 21:07:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 21:07:33,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 21:07:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 21:07:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-08 21:07:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2025-03-08 21:07:33,431 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2025-03-08 21:07:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:07:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-08 21:07:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2025-03-08 21:07:33,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2025-03-08 21:07:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2025-03-08 21:07:33,433 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2025-03-08 21:07:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:07:33,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-08 21:07:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:07:33,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:07:33,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2025-03-08 21:07:33,434 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-08 21:07:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:07:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-08 21:07:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2025-03-08 21:07:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2025-03-08 21:07:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2025-03-08 21:07:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2025-03-08 21:07:33,437 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:07:33,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2025-03-08 21:07:33,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2025-03-08 21:07:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2025-03-08 21:07:33,438 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2025-03-08 21:07:33,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:07:33,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:07:34,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15709: havoc #t~nondet826; [2025-03-08 21:07:34,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 21:07:34,051 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15697: havoc seq_open_net_#t~nondet823#1; [2025-03-08 21:07:34,054 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15589: havoc #t~nondet800; [2025-03-08 21:07:34,088 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc #t~nondet825; [2025-03-08 21:07:34,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10006: #res#1 := ~arg0#1; [2025-03-08 21:07:34,118 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~mem124; [2025-03-08 21:07:34,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15660: havoc nfnetlink_unicast_#t~nondet812#1; [2025-03-08 21:07:34,178 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: havoc #t~mem17; [2025-03-08 21:07:34,321 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7262: havoc skb_is_nonlinear_#t~mem56#1; [2025-03-08 21:07:34,321 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7273: havoc #t~ite62#1;havoc #t~mem60#1;havoc #t~mem61#1; [2025-03-08 21:07:34,324 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15671: havoc #t~nondet817; [2025-03-08 21:07:34,380 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc #t~bitwise4; [2025-03-08 21:07:34,469 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc #t~nondet811; [2025-03-08 21:07:34,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15628: havoc #t~nondet806; [2025-03-08 21:07:34,493 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15682: havoc #t~nondet820; [2025-03-08 21:07:34,496 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7311: havoc #t~mem84.base, #t~mem84.offset;havoc #t~mem85.base, #t~mem85.offset; [2025-03-08 21:07:34,532 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15564: havoc __nlmsg_put_#t~ret799#1.base, __nlmsg_put_#t~ret799#1.offset; [2025-03-08 21:07:34,615 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc #t~nondet819; [2025-03-08 21:07:34,647 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15701: havoc seq_printf_#t~nondet824#1; [2025-03-08 21:07:34,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9505-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-03-08 21:07:34,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10559-1: ldv_del_timer_148_#res#1 := ldv_del_timer_148_~ldv_func_res~0#1; [2025-03-08 21:07:34,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15593: havoc del_timer_#t~nondet801#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15693: havoc seq_lseek_#t~nondet822#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10574-1: ldv_netlink_register_notifier_155_#res#1 := ldv_netlink_register_notifier_155_~ldv_func_res~1#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15632: havoc nf_log_bind_pf_#t~nondet807#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7011: havoc hlist_empty_#t~mem8#1.base, hlist_empty_#t~mem8#1.offset; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7343: havoc read_pnet_#t~mem88#1.base, read_pnet_#t~mem88#1.offset; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc nf_log_register_#t~nondet808#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9294: call ULTIMATE.dealloc(nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset);havoc nfnl_log_net_init_~#__key~1#1.base, nfnl_log_net_init_~#__key~1#1.offset; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7479: havoc nla_get_be16_#t~mem126#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15674: havoc proc_create_data_#t~ret818#1.base, proc_create_data_#t~ret818#1.offset; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9994-1: ldv_netlink_register_notifier_#res#1 := ldv_netlink_register_notifier_~arg0#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10589-1: ldv_netlink_unregister_notifier_156_#res#1 := ldv_netlink_unregister_notifier_156_~ldv_func_res~2#1; [2025-03-08 21:07:39,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7485: havoc sk_user_ns_#t~mem127#1.base, sk_user_ns_#t~mem127#1.offset;havoc sk_user_ns_#t~mem128#1.base, sk_user_ns_#t~mem128#1.offset;havoc sk_user_ns_#t~mem129#1.base, sk_user_ns_#t~mem129#1.offset;havoc sk_user_ns_#t~mem130#1.base, sk_user_ns_#t~mem130#1.offset; [2025-03-08 21:07:39,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7789: call ULTIMATE.dealloc(instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset);havoc instance_create_~#__key~0#1.base, instance_create_~#__key~0#1.offset;call ULTIMATE.dealloc(instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset);havoc instance_create_~#__key___0~0#1.base, instance_create_~#__key___0~0#1.offset; [2025-03-08 21:07:39,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15652: havoc nfnetlink_subsys_register_#t~nondet810#1; [2025-03-08 21:07:39,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15686: havoc register_pernet_subsys_#t~nondet821#1; [2025-03-08 21:07:39,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15624: havoc netlink_register_notifier_#t~nondet805#1; [2025-03-08 21:07:39,551 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10604-1: ldv_netlink_unregister_notifier_157_#res#1 := ldv_netlink_unregister_notifier_157_~ldv_func_res~3#1; [2025-03-08 21:07:39,939 INFO L? ?]: Removed 1552 outVars from TransFormulas that were not future-live. [2025-03-08 21:07:39,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:07:39,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:07:39,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:07:39,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:07:39 BoogieIcfgContainer [2025-03-08 21:07:39,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:07:39,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:07:39,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:07:39,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:07:39,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:07:29" (1/3) ... [2025-03-08 21:07:39,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624758d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:07:39, skipping insertion in model container [2025-03-08 21:07:39,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:07:32" (2/3) ... [2025-03-08 21:07:39,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624758d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:07:39, skipping insertion in model container [2025-03-08 21:07:39,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:07:39" (3/3) ... [2025-03-08 21:07:39,990 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-08 21:07:40,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:07:40,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i that has 86 procedures, 1133 locations, 1 initial locations, 1 loop locations, and 32 error locations. [2025-03-08 21:07:40,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:07:40,102 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;@50209b27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:07:40,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-08 21:07:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 1132 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 809 states have internal predecessors, (939), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-08 21:07:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:07:40,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:40,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:40,118 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 30 more)] === [2025-03-08 21:07:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1936976021, now seen corresponding path program 1 times [2025-03-08 21:07:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148102757] [2025-03-08 21:07:40,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:40,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:07:40,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:07:40,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:40,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:41,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148102757] [2025-03-08 21:07:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148102757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:41,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:41,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252595781] [2025-03-08 21:07:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:41,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:41,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:41,631 INFO L87 Difference]: Start difference. First operand has 1132 states, 752 states have (on average 1.2486702127659575) internal successors, (939), 809 states have internal predecessors, (939), 263 states have call successors, (263), 85 states have call predecessors, (263), 84 states have return successors, (258), 254 states have call predecessors, (258), 258 states have call successors, (258) 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, (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-03-08 21:07:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:41,911 INFO L93 Difference]: Finished difference Result 2229 states and 2965 transitions. [2025-03-08 21:07:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:41,914 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, (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 70 [2025-03-08 21:07:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:41,936 INFO L225 Difference]: With dead ends: 2229 [2025-03-08 21:07:41,936 INFO L226 Difference]: Without dead ends: 1106 [2025-03-08 21:07:41,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:41,951 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1374 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:41,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 2809 Invalid, 6 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-08 21:07:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2025-03-08 21:07:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 735 states have (on average 1.1918367346938776) internal successors, (876), 786 states have internal predecessors, (876), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 21:07:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1390 transitions. [2025-03-08 21:07:42,071 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1390 transitions. Word has length 70 [2025-03-08 21:07:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:42,072 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1390 transitions. [2025-03-08 21:07:42,072 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, (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-03-08 21:07:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1390 transitions. [2025-03-08 21:07:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 21:07:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:42,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:42,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:07:42,075 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 30 more)] === [2025-03-08 21:07:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -795744948, now seen corresponding path program 1 times [2025-03-08 21:07:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089079906] [2025-03-08 21:07:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:42,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 21:07:42,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 21:07:42,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:42,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089079906] [2025-03-08 21:07:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089079906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683705567] [2025-03-08 21:07:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:42,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:42,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:42,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:42,838 INFO L87 Difference]: Start difference. First operand 1106 states and 1390 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:07:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:42,926 INFO L93 Difference]: Finished difference Result 1106 states and 1390 transitions. [2025-03-08 21:07:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:42,928 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, (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 76 [2025-03-08 21:07:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:42,935 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 21:07:42,935 INFO L226 Difference]: Without dead ends: 1104 [2025-03-08 21:07:42,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:42,936 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 1353 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:42,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2769 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-03-08 21:07:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2025-03-08 21:07:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 734 states have (on average 1.1907356948228882) internal successors, (874), 784 states have internal predecessors, (874), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 21:07:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1388 transitions. [2025-03-08 21:07:43,009 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1388 transitions. Word has length 76 [2025-03-08 21:07:43,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:43,009 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1388 transitions. [2025-03-08 21:07:43,009 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 21:07:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1388 transitions. [2025-03-08 21:07:43,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 21:07:43,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:43,011 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:07:43,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:07:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash 181132603, now seen corresponding path program 1 times [2025-03-08 21:07:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:43,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700609729] [2025-03-08 21:07:43,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 21:07:43,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 21:07:43,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:43,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:43,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700609729] [2025-03-08 21:07:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700609729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886137307] [2025-03-08 21:07:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:43,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:43,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:43,713 INFO L87 Difference]: Start difference. First operand 1104 states and 1388 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:07:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:43,807 INFO L93 Difference]: Finished difference Result 1104 states and 1388 transitions. [2025-03-08 21:07:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:43,808 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, (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 82 [2025-03-08 21:07:43,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:43,816 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 21:07:43,816 INFO L226 Difference]: Without dead ends: 1102 [2025-03-08 21:07:43,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:43,818 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 1350 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:43,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2765 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-08 21:07:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-03-08 21:07:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 733 states have (on average 1.189631650750341) internal successors, (872), 782 states have internal predecessors, (872), 258 states have call successors, (258), 84 states have call predecessors, (258), 83 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-08 21:07:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1386 transitions. [2025-03-08 21:07:43,879 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1386 transitions. Word has length 82 [2025-03-08 21:07:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:43,880 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1386 transitions. [2025-03-08 21:07:43,880 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 21:07:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1386 transitions. [2025-03-08 21:07:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 21:07:43,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:43,884 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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] [2025-03-08 21:07:43,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:07:43,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:07:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 756773291, now seen corresponding path program 1 times [2025-03-08 21:07:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227641734] [2025-03-08 21:07:43,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:44,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 21:07:44,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 21:07:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 21:07:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:44,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227641734] [2025-03-08 21:07:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227641734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:44,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184534327] [2025-03-08 21:07:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:44,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:44,803 INFO L87 Difference]: Start difference. First operand 1102 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 21:07:48,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:07:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:50,165 INFO L93 Difference]: Finished difference Result 1821 states and 2249 transitions. [2025-03-08 21:07:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:50,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2025-03-08 21:07:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:50,175 INFO L225 Difference]: With dead ends: 1821 [2025-03-08 21:07:50,175 INFO L226 Difference]: Without dead ends: 1819 [2025-03-08 21:07:50,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:07:50,177 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 845 mSDsluCounter, 4070 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 5598 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:50,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 5598 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 21:07:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-03-08 21:07:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1624. [2025-03-08 21:07:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1079 states have (on average 1.1779425393883225) internal successors, (1271), 1144 states have internal predecessors, (1271), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-08 21:07:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2041 transitions. [2025-03-08 21:07:50,259 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2041 transitions. Word has length 97 [2025-03-08 21:07:50,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:50,260 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2041 transitions. [2025-03-08 21:07:50,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 21:07:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2041 transitions. [2025-03-08 21:07:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 21:07:50,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:50,261 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:50,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:07:50,261 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 30 more)] === [2025-03-08 21:07:50,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1980409754, now seen corresponding path program 1 times [2025-03-08 21:07:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800840947] [2025-03-08 21:07:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:50,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 21:07:50,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 21:07:50,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:50,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800840947] [2025-03-08 21:07:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800840947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047568697] [2025-03-08 21:07:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:50,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:50,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:50,849 INFO L87 Difference]: Start difference. First operand 1624 states and 2041 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:07:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:50,969 INFO L93 Difference]: Finished difference Result 1624 states and 2041 transitions. [2025-03-08 21:07:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:50,969 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, (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 88 [2025-03-08 21:07:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:50,977 INFO L225 Difference]: With dead ends: 1624 [2025-03-08 21:07:50,977 INFO L226 Difference]: Without dead ends: 1622 [2025-03-08 21:07:50,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:50,978 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1347 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:50,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 2761 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-08 21:07:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2025-03-08 21:07:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1078 states have (on average 1.1771799628942485) internal successors, (1269), 1142 states have internal predecessors, (1269), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-08 21:07:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2039 transitions. [2025-03-08 21:07:51,047 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2039 transitions. Word has length 88 [2025-03-08 21:07:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:51,048 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2039 transitions. [2025-03-08 21:07:51,048 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:07:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2039 transitions. [2025-03-08 21:07:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 21:07:51,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:51,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:07:51,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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 30 more)] === [2025-03-08 21:07:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash 367553455, now seen corresponding path program 1 times [2025-03-08 21:07:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030563522] [2025-03-08 21:07:51,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:51,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:07:51,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:07:51,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:51,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030563522] [2025-03-08 21:07:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030563522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037647345] [2025-03-08 21:07:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:51,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:51,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:51,689 INFO L87 Difference]: Start difference. First operand 1622 states and 2039 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:07:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:51,821 INFO L93 Difference]: Finished difference Result 1622 states and 2039 transitions. [2025-03-08 21:07:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:51,822 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, (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 94 [2025-03-08 21:07:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:51,831 INFO L225 Difference]: With dead ends: 1622 [2025-03-08 21:07:51,831 INFO L226 Difference]: Without dead ends: 1620 [2025-03-08 21:07:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:51,833 INFO L435 NwaCegarLoop]: 1379 mSDtfsCounter, 1344 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-08 21:07:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2025-03-08 21:07:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1077 states have (on average 1.1764159702878365) internal successors, (1267), 1140 states have internal predecessors, (1267), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-08 21:07:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2037 transitions. [2025-03-08 21:07:51,949 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2037 transitions. Word has length 94 [2025-03-08 21:07:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:51,950 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2037 transitions. [2025-03-08 21:07:51,950 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 21:07:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2037 transitions. [2025-03-08 21:07:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 21:07:51,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:51,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:07:51,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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 30 more)] === [2025-03-08 21:07:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1797485288, now seen corresponding path program 1 times [2025-03-08 21:07:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:51,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543189047] [2025-03-08 21:07:51,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:52,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 21:07:52,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 21:07:52,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:52,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543189047] [2025-03-08 21:07:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543189047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944979527] [2025-03-08 21:07:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:52,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:52,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:52,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:52,553 INFO L87 Difference]: Start difference. First operand 1620 states and 2037 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:07:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:52,641 INFO L93 Difference]: Finished difference Result 1620 states and 2037 transitions. [2025-03-08 21:07:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:52,642 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, (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 100 [2025-03-08 21:07:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:52,650 INFO L225 Difference]: With dead ends: 1620 [2025-03-08 21:07:52,650 INFO L226 Difference]: Without dead ends: 1618 [2025-03-08 21:07:52,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:52,652 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1341 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:52,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 2753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-08 21:07:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2025-03-08 21:07:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1076 states have (on average 1.1756505576208178) internal successors, (1265), 1138 states have internal predecessors, (1265), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-08 21:07:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2035 transitions. [2025-03-08 21:07:52,728 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2035 transitions. Word has length 100 [2025-03-08 21:07:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:52,728 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 2035 transitions. [2025-03-08 21:07:52,728 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:07:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2035 transitions. [2025-03-08 21:07:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 21:07:52,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:52,730 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:52,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:07:52,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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 30 more)] === [2025-03-08 21:07:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -580253685, now seen corresponding path program 1 times [2025-03-08 21:07:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086472151] [2025-03-08 21:07:52,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:53,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 21:07:53,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 21:07:53,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:53,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:53,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:53,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086472151] [2025-03-08 21:07:53,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086472151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:53,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:53,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909364944] [2025-03-08 21:07:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:53,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:53,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:53,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:53,285 INFO L87 Difference]: Start difference. First operand 1618 states and 2035 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:07:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:53,378 INFO L93 Difference]: Finished difference Result 1618 states and 2035 transitions. [2025-03-08 21:07:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:53,379 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, (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 106 [2025-03-08 21:07:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:53,386 INFO L225 Difference]: With dead ends: 1618 [2025-03-08 21:07:53,386 INFO L226 Difference]: Without dead ends: 1616 [2025-03-08 21:07:53,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:53,388 INFO L435 NwaCegarLoop]: 1375 mSDtfsCounter, 1338 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:53,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 2749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-03-08 21:07:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2025-03-08 21:07:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1075 states have (on average 1.1748837209302325) internal successors, (1263), 1136 states have internal predecessors, (1263), 385 states have call successors, (385), 134 states have call predecessors, (385), 132 states have return successors, (385), 370 states have call predecessors, (385), 383 states have call successors, (385) [2025-03-08 21:07:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2033 transitions. [2025-03-08 21:07:53,465 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2033 transitions. Word has length 106 [2025-03-08 21:07:53,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:53,466 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2033 transitions. [2025-03-08 21:07:53,466 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 21:07:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2033 transitions. [2025-03-08 21:07:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 21:07:53,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:53,467 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] [2025-03-08 21:07:53,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:07:53,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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 30 more)] === [2025-03-08 21:07:53,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1525927495, now seen corresponding path program 1 times [2025-03-08 21:07:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:53,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905007301] [2025-03-08 21:07:53,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:53,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 21:07:53,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 21:07:53,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:53,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-08 21:07:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905007301] [2025-03-08 21:07:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905007301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:07:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115668532] [2025-03-08 21:07:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:54,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:54,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:54,129 INFO L87 Difference]: Start difference. First operand 1616 states and 2033 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:07:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:54,316 INFO L93 Difference]: Finished difference Result 1796 states and 2231 transitions. [2025-03-08 21:07:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-08 21:07:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:54,324 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 21:07:54,325 INFO L226 Difference]: Without dead ends: 1794 [2025-03-08 21:07:54,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:07:54,328 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 1186 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 4886 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:54,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 4886 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:07:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-03-08 21:07:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1782. [2025-03-08 21:07:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1192 states have (on average 1.1770134228187918) internal successors, (1403), 1253 states have internal predecessors, (1403), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-03-08 21:07:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2223 transitions. [2025-03-08 21:07:54,413 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2223 transitions. Word has length 118 [2025-03-08 21:07:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:54,413 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2223 transitions. [2025-03-08 21:07:54,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 21:07:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2223 transitions. [2025-03-08 21:07:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 21:07:54,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:54,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:54,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:07:54,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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 30 more)] === [2025-03-08 21:07:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -251956025, now seen corresponding path program 1 times [2025-03-08 21:07:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737257310] [2025-03-08 21:07:54,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:55,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 21:07:55,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 21:07:55,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:55,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737257310] [2025-03-08 21:07:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737257310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:55,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:55,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:55,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942094107] [2025-03-08 21:07:55,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:55,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:55,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:55,340 INFO L87 Difference]: Start difference. First operand 1782 states and 2223 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:55,448 INFO L93 Difference]: Finished difference Result 1782 states and 2223 transitions. [2025-03-08 21:07:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:55,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 112 [2025-03-08 21:07:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:55,456 INFO L225 Difference]: With dead ends: 1782 [2025-03-08 21:07:55,457 INFO L226 Difference]: Without dead ends: 1780 [2025-03-08 21:07:55,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:55,458 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 1335 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:55,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-08 21:07:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1780. [2025-03-08 21:07:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1191 states have (on average 1.1763224181360201) internal successors, (1401), 1251 states have internal predecessors, (1401), 410 states have call successors, (410), 158 states have call predecessors, (410), 156 states have return successors, (410), 395 states have call predecessors, (410), 408 states have call successors, (410) [2025-03-08 21:07:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2221 transitions. [2025-03-08 21:07:55,590 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2221 transitions. Word has length 112 [2025-03-08 21:07:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 2221 transitions. [2025-03-08 21:07:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2221 transitions. [2025-03-08 21:07:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 21:07:55,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:55,592 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 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] [2025-03-08 21:07:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:07:55,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting rcu_read_unlock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:07:55,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -969121805, now seen corresponding path program 1 times [2025-03-08 21:07:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826099499] [2025-03-08 21:07:55,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:55,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 21:07:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:07:56,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:56,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-08 21:07:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826099499] [2025-03-08 21:07:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826099499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:07:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955820583] [2025-03-08 21:07:56,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:56,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:07:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:07:56,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:07:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:07:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 21:07:57,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:07:57,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:57,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:57,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:07:57,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:07:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 21:07:57,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:07:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955820583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:07:57,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 21:07:57,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74219187] [2025-03-08 21:07:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:07:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:07:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:07:57,578 INFO L87 Difference]: Start difference. First operand 1780 states and 2221 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 21:07:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:58,042 INFO L93 Difference]: Finished difference Result 3393 states and 4203 transitions. [2025-03-08 21:07:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:07:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 134 [2025-03-08 21:07:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:58,053 INFO L225 Difference]: With dead ends: 3393 [2025-03-08 21:07:58,054 INFO L226 Difference]: Without dead ends: 1788 [2025-03-08 21:07:58,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:07:58,060 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 36 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:58,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 5318 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:07:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-03-08 21:07:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1786. [2025-03-08 21:07:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1195 states have (on average 1.1757322175732217) internal successors, (1405), 1255 states have internal predecessors, (1405), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-03-08 21:07:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2229 transitions. [2025-03-08 21:07:58,165 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2229 transitions. Word has length 134 [2025-03-08 21:07:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:58,168 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2229 transitions. [2025-03-08 21:07:58,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 21:07:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2229 transitions. [2025-03-08 21:07:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 21:07:58,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:58,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:58,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:07:58,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 21:07:58,370 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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 30 more)] === [2025-03-08 21:07:58,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1611529790, now seen corresponding path program 1 times [2025-03-08 21:07:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429830473] [2025-03-08 21:07:58,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:58,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 21:07:58,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 21:07:58,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:58,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429830473] [2025-03-08 21:07:58,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429830473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:58,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:58,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:58,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535563610] [2025-03-08 21:07:58,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:58,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:58,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:58,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:58,916 INFO L87 Difference]: Start difference. First operand 1786 states and 2229 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:59,021 INFO L93 Difference]: Finished difference Result 1786 states and 2229 transitions. [2025-03-08 21:07:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:59,022 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, (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 114 [2025-03-08 21:07:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:59,030 INFO L225 Difference]: With dead ends: 1786 [2025-03-08 21:07:59,031 INFO L226 Difference]: Without dead ends: 1784 [2025-03-08 21:07:59,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:59,032 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1331 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:59,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2741 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-08 21:07:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2025-03-08 21:07:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1194 states have (on average 1.1750418760469012) internal successors, (1403), 1253 states have internal predecessors, (1403), 412 states have call successors, (412), 158 states have call predecessors, (412), 156 states have return successors, (412), 397 states have call predecessors, (412), 410 states have call successors, (412) [2025-03-08 21:07:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2227 transitions. [2025-03-08 21:07:59,129 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2227 transitions. Word has length 114 [2025-03-08 21:07:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:07:59,129 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2227 transitions. [2025-03-08 21:07:59,130 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 21:07:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2227 transitions. [2025-03-08 21:07:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 21:07:59,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:07:59,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:07:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:07:59,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:07:59,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:07:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1361072232, now seen corresponding path program 1 times [2025-03-08 21:07:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:07:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17887039] [2025-03-08 21:07:59,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:07:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:07:59,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 21:07:59,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 21:07:59,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:07:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:07:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:07:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:07:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17887039] [2025-03-08 21:07:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17887039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:07:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:07:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:07:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628315588] [2025-03-08 21:07:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:07:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:07:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:07:59,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:07:59,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:07:59,663 INFO L87 Difference]: Start difference. First operand 1784 states and 2227 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:07:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:07:59,843 INFO L93 Difference]: Finished difference Result 2694 states and 3300 transitions. [2025-03-08 21:07:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:07:59,843 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, (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 120 [2025-03-08 21:07:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:07:59,854 INFO L225 Difference]: With dead ends: 2694 [2025-03-08 21:07:59,854 INFO L226 Difference]: Without dead ends: 2692 [2025-03-08 21:07:59,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:07:59,856 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 1329 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:07:59,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 3664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:07:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-03-08 21:08:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2647. [2025-03-08 21:08:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 1799 states have (on average 1.1784324624791551) internal successors, (2120), 1866 states have internal predecessors, (2120), 577 states have call successors, (577), 251 states have call predecessors, (577), 249 states have return successors, (577), 561 states have call predecessors, (577), 575 states have call successors, (577) [2025-03-08 21:08:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3274 transitions. [2025-03-08 21:08:00,093 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3274 transitions. Word has length 120 [2025-03-08 21:08:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:00,093 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 3274 transitions. [2025-03-08 21:08:00,094 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 21:08:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3274 transitions. [2025-03-08 21:08:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 21:08:00,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:00,095 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:08:00,095 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 30 more)] === [2025-03-08 21:08:00,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1200389913, now seen corresponding path program 1 times [2025-03-08 21:08:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517275273] [2025-03-08 21:08:00,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 21:08:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 21:08:00,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:00,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517275273] [2025-03-08 21:08:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517275273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:00,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:00,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994920209] [2025-03-08 21:08:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:00,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:00,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:00,673 INFO L87 Difference]: Start difference. First operand 2647 states and 3274 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:00,878 INFO L93 Difference]: Finished difference Result 3765 states and 4593 transitions. [2025-03-08 21:08:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:00,878 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, (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 126 [2025-03-08 21:08:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:00,895 INFO L225 Difference]: With dead ends: 3765 [2025-03-08 21:08:00,895 INFO L226 Difference]: Without dead ends: 3763 [2025-03-08 21:08:00,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-03-08 21:08:00,898 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 847 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:00,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 3927 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-03-08 21:08:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3622. [2025-03-08 21:08:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 2457 states have (on average 1.1693121693121693) internal successors, (2873), 2546 states have internal predecessors, (2873), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-08 21:08:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4453 transitions. [2025-03-08 21:08:01,100 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4453 transitions. Word has length 126 [2025-03-08 21:08:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 3622 states and 4453 transitions. [2025-03-08 21:08:01,102 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4453 transitions. [2025-03-08 21:08:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 21:08:01,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:01,104 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1] [2025-03-08 21:08:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:08:01,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 764242988, now seen corresponding path program 1 times [2025-03-08 21:08:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301843749] [2025-03-08 21:08:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:01,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 21:08:01,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 21:08:01,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:01,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301843749] [2025-03-08 21:08:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301843749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:01,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:01,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:08:01,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976210576] [2025-03-08 21:08:01,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:08:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:01,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:08:01,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:08:01,560 INFO L87 Difference]: Start difference. First operand 3622 states and 4453 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 21:08:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:01,734 INFO L93 Difference]: Finished difference Result 6381 states and 7824 transitions. [2025-03-08 21:08:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:08:01,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-08 21:08:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:01,749 INFO L225 Difference]: With dead ends: 6381 [2025-03-08 21:08:01,749 INFO L226 Difference]: Without dead ends: 3633 [2025-03-08 21:08:01,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:08:01,759 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 13 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:01,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2737 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-03-08 21:08:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3623. [2025-03-08 21:08:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2458 states have (on average 1.1692432872253864) internal successors, (2874), 2547 states have internal predecessors, (2874), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-08 21:08:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4454 transitions. [2025-03-08 21:08:01,953 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4454 transitions. Word has length 141 [2025-03-08 21:08:01,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:01,954 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 4454 transitions. [2025-03-08 21:08:01,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 21:08:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4454 transitions. [2025-03-08 21:08:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 21:08:01,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:01,955 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:01,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:08:01,956 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 30 more)] === [2025-03-08 21:08:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 615069842, now seen corresponding path program 1 times [2025-03-08 21:08:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:01,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662263072] [2025-03-08 21:08:01,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:02,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 21:08:02,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 21:08:02,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:02,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662263072] [2025-03-08 21:08:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662263072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244738896] [2025-03-08 21:08:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:02,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:02,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:02,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:02,506 INFO L87 Difference]: Start difference. First operand 3623 states and 4454 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:08:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:02,772 INFO L93 Difference]: Finished difference Result 3623 states and 4454 transitions. [2025-03-08 21:08:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:02,772 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, (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 132 [2025-03-08 21:08:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:02,788 INFO L225 Difference]: With dead ends: 3623 [2025-03-08 21:08:02,788 INFO L226 Difference]: Without dead ends: 3621 [2025-03-08 21:08:02,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:02,790 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1328 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:02,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2735 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2025-03-08 21:08:03,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3621. [2025-03-08 21:08:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2457 states have (on average 1.1684981684981686) internal successors, (2871), 2545 states have internal predecessors, (2871), 790 states have call successors, (790), 356 states have call predecessors, (790), 353 states have return successors, (790), 764 states have call predecessors, (790), 788 states have call successors, (790) [2025-03-08 21:08:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4451 transitions. [2025-03-08 21:08:03,028 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4451 transitions. Word has length 132 [2025-03-08 21:08:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 4451 transitions. [2025-03-08 21:08:03,028 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:08:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4451 transitions. [2025-03-08 21:08:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 21:08:03,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:03,030 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:08:03,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:03,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2010365465, now seen corresponding path program 1 times [2025-03-08 21:08:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275089208] [2025-03-08 21:08:03,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:03,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 21:08:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 21:08:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:03,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275089208] [2025-03-08 21:08:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275089208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:08:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953620152] [2025-03-08 21:08:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:08:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:08:03,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:08:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:08:04,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 21:08:04,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 21:08:04,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:04,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:08:04,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:08:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:04,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:08:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953620152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:08:05,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:08:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 21:08:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297359990] [2025-03-08 21:08:05,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:08:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:08:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:08:05,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:08:05,057 INFO L87 Difference]: Start difference. First operand 3621 states and 4451 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 21:08:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:05,332 INFO L93 Difference]: Finished difference Result 6401 states and 7854 transitions. [2025-03-08 21:08:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:08:05,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-08 21:08:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:05,347 INFO L225 Difference]: With dead ends: 6401 [2025-03-08 21:08:05,348 INFO L226 Difference]: Without dead ends: 3654 [2025-03-08 21:08:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:08:05,358 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 80 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:05,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2765 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:08:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2025-03-08 21:08:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2025-03-08 21:08:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.1712907117008444) internal successors, (2913), 2578 states have internal predecessors, (2913), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-03-08 21:08:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4499 transitions. [2025-03-08 21:08:05,544 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4499 transitions. Word has length 146 [2025-03-08 21:08:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:05,544 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4499 transitions. [2025-03-08 21:08:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 21:08:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4499 transitions. [2025-03-08 21:08:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 21:08:05,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:05,546 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:05,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:08:05,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 21:08:05,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_for_read_sectionErr3ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:05,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1614527992, now seen corresponding path program 1 times [2025-03-08 21:08:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:05,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140190970] [2025-03-08 21:08:05,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:05,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 21:08:06,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 21:08:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140190970] [2025-03-08 21:08:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140190970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:06,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:06,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292621749] [2025-03-08 21:08:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:06,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:06,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:06,307 INFO L87 Difference]: Start difference. First operand 3654 states and 4499 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:06,520 INFO L93 Difference]: Finished difference Result 3698 states and 4531 transitions. [2025-03-08 21:08:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-08 21:08:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:06,533 INFO L225 Difference]: With dead ends: 3698 [2025-03-08 21:08:06,533 INFO L226 Difference]: Without dead ends: 3696 [2025-03-08 21:08:06,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:06,535 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 851 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 3921 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:06,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 3921 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2025-03-08 21:08:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3654. [2025-03-08 21:08:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2487 states have (on average 1.1700844390832328) internal successors, (2910), 2578 states have internal predecessors, (2910), 793 states have call successors, (793), 356 states have call predecessors, (793), 353 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-03-08 21:08:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4496 transitions. [2025-03-08 21:08:06,707 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4496 transitions. Word has length 147 [2025-03-08 21:08:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4496 transitions. [2025-03-08 21:08:06,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4496 transitions. [2025-03-08 21:08:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 21:08:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:06,709 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:06,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:08:06,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 30 more)] === [2025-03-08 21:08:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1430509017, now seen corresponding path program 1 times [2025-03-08 21:08:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:06,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161297113] [2025-03-08 21:08:06,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:07,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 21:08:07,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 21:08:07,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:07,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161297113] [2025-03-08 21:08:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161297113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366613580] [2025-03-08 21:08:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:07,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:07,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:07,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:07,177 INFO L87 Difference]: Start difference. First operand 3654 states and 4496 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:08:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:07,379 INFO L93 Difference]: Finished difference Result 3987 states and 4848 transitions. [2025-03-08 21:08:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:07,379 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, (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 138 [2025-03-08 21:08:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:07,392 INFO L225 Difference]: With dead ends: 3987 [2025-03-08 21:08:07,393 INFO L226 Difference]: Without dead ends: 3985 [2025-03-08 21:08:07,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:07,394 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 781 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:07,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 4376 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2025-03-08 21:08:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3858. [2025-03-08 21:08:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 2623 states have (on average 1.161646969119329) internal successors, (3047), 2714 states have internal predecessors, (3047), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 4713 transitions. [2025-03-08 21:08:07,613 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 4713 transitions. Word has length 138 [2025-03-08 21:08:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:07,613 INFO L471 AbstractCegarLoop]: Abstraction has 3858 states and 4713 transitions. [2025-03-08 21:08:07,614 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 21:08:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 4713 transitions. [2025-03-08 21:08:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 21:08:07,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:07,617 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:08:07,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_for_read_sectionErr2ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -934285689, now seen corresponding path program 1 times [2025-03-08 21:08:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618295519] [2025-03-08 21:08:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:08,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 21:08:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 21:08:08,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:08,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618295519] [2025-03-08 21:08:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618295519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303221554] [2025-03-08 21:08:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:08,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:08,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:08,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:08,402 INFO L87 Difference]: Start difference. First operand 3858 states and 4713 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:08,586 INFO L93 Difference]: Finished difference Result 3858 states and 4713 transitions. [2025-03-08 21:08:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:08,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 150 [2025-03-08 21:08:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:08,599 INFO L225 Difference]: With dead ends: 3858 [2025-03-08 21:08:08,600 INFO L226 Difference]: Without dead ends: 3856 [2025-03-08 21:08:08,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:08,602 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1332 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 2731 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2025-03-08 21:08:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3856. [2025-03-08 21:08:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3856 states, 2622 states have (on average 1.1586575133485888) internal successors, (3038), 2712 states have internal predecessors, (3038), 833 states have call successors, (833), 384 states have call predecessors, (833), 381 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 4704 transitions. [2025-03-08 21:08:08,778 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 4704 transitions. Word has length 150 [2025-03-08 21:08:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 3856 states and 4704 transitions. [2025-03-08 21:08:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 4704 transitions. [2025-03-08 21:08:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 21:08:08,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:08,781 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:08:08,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_for_read_sectionErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:08,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1915838320, now seen corresponding path program 1 times [2025-03-08 21:08:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:08,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393393453] [2025-03-08 21:08:08,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:08,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:08:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:08:09,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:09,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 21:08:10,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:10,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393393453] [2025-03-08 21:08:10,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393393453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:08:10,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807888573] [2025-03-08 21:08:10,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:08:10,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:08:10,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:08:10,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:08:11,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 21:08:11,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 21:08:11,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:11,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:11,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 21:08:11,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:08:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:11,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:08:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807888573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:08:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2025-03-08 21:08:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039601157] [2025-03-08 21:08:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:08:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:11,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:08:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-08 21:08:11,639 INFO L87 Difference]: Start difference. First operand 3856 states and 4704 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 21:08:15,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:08:19,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:08:23,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:23,583 INFO L93 Difference]: Finished difference Result 3880 states and 4720 transitions. [2025-03-08 21:08:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:08:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-03-08 21:08:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:23,596 INFO L225 Difference]: With dead ends: 3880 [2025-03-08 21:08:23,596 INFO L226 Difference]: Without dead ends: 3878 [2025-03-08 21:08:23,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-08 21:08:23,598 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 1378 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 448 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:23,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 2194 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2571 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2025-03-08 21:08:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2025-03-08 21:08:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3878. [2025-03-08 21:08:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3878 states, 2637 states have (on average 1.154721274175199) internal successors, (3045), 2726 states have internal predecessors, (3045), 833 states have call successors, (833), 392 states have call predecessors, (833), 389 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 4711 transitions. [2025-03-08 21:08:23,792 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 4711 transitions. Word has length 153 [2025-03-08 21:08:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 3878 states and 4711 transitions. [2025-03-08 21:08:23,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 21:08:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 4711 transitions. [2025-03-08 21:08:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 21:08:23,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:23,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:23,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:08:23,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:08:23,995 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:23,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1688972044, now seen corresponding path program 1 times [2025-03-08 21:08:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:23,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028182371] [2025-03-08 21:08:23,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:24,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:08:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:08:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:24,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028182371] [2025-03-08 21:08:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028182371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480875058] [2025-03-08 21:08:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:24,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:24,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:24,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:24,481 INFO L87 Difference]: Start difference. First operand 3878 states and 4711 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:08:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:24,673 INFO L93 Difference]: Finished difference Result 3878 states and 4711 transitions. [2025-03-08 21:08:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:24,673 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, (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 144 [2025-03-08 21:08:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:24,689 INFO L225 Difference]: With dead ends: 3878 [2025-03-08 21:08:24,690 INFO L226 Difference]: Without dead ends: 3876 [2025-03-08 21:08:24,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:24,693 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1320 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:24,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 2723 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3876 states. [2025-03-08 21:08:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3876 to 3876. [2025-03-08 21:08:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 2636 states have (on average 1.1540212443095599) internal successors, (3042), 2724 states have internal predecessors, (3042), 833 states have call successors, (833), 392 states have call predecessors, (833), 389 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4708 transitions. [2025-03-08 21:08:24,886 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4708 transitions. Word has length 144 [2025-03-08 21:08:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:24,886 INFO L471 AbstractCegarLoop]: Abstraction has 3876 states and 4708 transitions. [2025-03-08 21:08:24,886 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 21:08:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4708 transitions. [2025-03-08 21:08:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 21:08:24,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:24,888 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:24,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:08:24,889 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_check_for_read_sectionErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:24,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1082042079, now seen corresponding path program 1 times [2025-03-08 21:08:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:24,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400954832] [2025-03-08 21:08:24,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:25,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 21:08:25,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 21:08:25,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:25,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 21:08:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:25,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400954832] [2025-03-08 21:08:25,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400954832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:25,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93919197] [2025-03-08 21:08:25,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:25,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:25,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:25,385 INFO L87 Difference]: Start difference. First operand 3876 states and 4708 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:25,576 INFO L93 Difference]: Finished difference Result 3876 states and 4708 transitions. [2025-03-08 21:08:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:25,576 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-08 21:08:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:25,586 INFO L225 Difference]: With dead ends: 3876 [2025-03-08 21:08:25,586 INFO L226 Difference]: Without dead ends: 3874 [2025-03-08 21:08:25,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:25,588 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1320 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:25,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 2719 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2025-03-08 21:08:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3874. [2025-03-08 21:08:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3874 states, 2635 states have (on average 1.1510436432637572) internal successors, (3033), 2722 states have internal predecessors, (3033), 833 states have call successors, (833), 392 states have call predecessors, (833), 389 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 4699 transitions. [2025-03-08 21:08:25,774 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 4699 transitions. Word has length 156 [2025-03-08 21:08:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:25,774 INFO L471 AbstractCegarLoop]: Abstraction has 3874 states and 4699 transitions. [2025-03-08 21:08:25,774 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 4699 transitions. [2025-03-08 21:08:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 21:08:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:25,776 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:08:25,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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 30 more)] === [2025-03-08 21:08:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -314853310, now seen corresponding path program 1 times [2025-03-08 21:08:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881278042] [2025-03-08 21:08:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 21:08:26,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 21:08:26,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:26,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881278042] [2025-03-08 21:08:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881278042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775239490] [2025-03-08 21:08:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:26,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:26,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:26,258 INFO L87 Difference]: Start difference. First operand 3874 states and 4699 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:08:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:26,459 INFO L93 Difference]: Finished difference Result 3874 states and 4699 transitions. [2025-03-08 21:08:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:26,459 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, (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 150 [2025-03-08 21:08:26,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:26,468 INFO L225 Difference]: With dead ends: 3874 [2025-03-08 21:08:26,468 INFO L226 Difference]: Without dead ends: 3872 [2025-03-08 21:08:26,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:26,469 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1315 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:26,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 2717 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2025-03-08 21:08:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3872. [2025-03-08 21:08:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3872 states, 2634 states have (on average 1.1503416856492028) internal successors, (3030), 2720 states have internal predecessors, (3030), 833 states have call successors, (833), 392 states have call predecessors, (833), 389 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 4696 transitions. [2025-03-08 21:08:26,677 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 4696 transitions. Word has length 150 [2025-03-08 21:08:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:26,677 INFO L471 AbstractCegarLoop]: Abstraction has 3872 states and 4696 transitions. [2025-03-08 21:08:26,678 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 21:08:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 4696 transitions. [2025-03-08 21:08:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 21:08:26,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:26,681 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1] [2025-03-08 21:08:26,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:08:26,681 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:26,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1990881812, now seen corresponding path program 2 times [2025-03-08 21:08:26,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478306178] [2025-03-08 21:08:26,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:08:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:27,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 161 statements into 2 equivalence classes. [2025-03-08 21:08:27,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 161 statements. [2025-03-08 21:08:27,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:08:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-08 21:08:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478306178] [2025-03-08 21:08:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478306178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:08:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612978036] [2025-03-08 21:08:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:08:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:08:27,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:27,143 INFO L87 Difference]: Start difference. First operand 3872 states and 4696 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:31,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 21:08:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:31,444 INFO L93 Difference]: Finished difference Result 3892 states and 4712 transitions. [2025-03-08 21:08:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:08:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-03-08 21:08:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:31,454 INFO L225 Difference]: With dead ends: 3892 [2025-03-08 21:08:31,454 INFO L226 Difference]: Without dead ends: 3890 [2025-03-08 21:08:31,455 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-03-08 21:08:31,456 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 349 mSDsluCounter, 4011 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 5426 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:31,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 5426 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 21:08:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2025-03-08 21:08:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3884. [2025-03-08 21:08:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 2643 states have (on average 1.1498297389330308) internal successors, (3039), 2729 states have internal predecessors, (3039), 833 states have call successors, (833), 395 states have call predecessors, (833), 392 states have return successors, (833), 807 states have call predecessors, (833), 831 states have call successors, (833) [2025-03-08 21:08:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 4705 transitions. [2025-03-08 21:08:31,689 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 4705 transitions. Word has length 161 [2025-03-08 21:08:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 3884 states and 4705 transitions. [2025-03-08 21:08:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 21:08:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 4705 transitions. [2025-03-08 21:08:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 21:08:31,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:31,693 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:31,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 21:08:31,693 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 30 more)] === [2025-03-08 21:08:31,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -48723171, now seen corresponding path program 1 times [2025-03-08 21:08:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:31,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745594397] [2025-03-08 21:08:31,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:32,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 21:08:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 21:08:32,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:32,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-08 21:08:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:32,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745594397] [2025-03-08 21:08:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745594397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:32,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:32,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:08:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547526677] [2025-03-08 21:08:32,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:08:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:32,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:08:32,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:32,462 INFO L87 Difference]: Start difference. First operand 3884 states and 4705 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:08:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:32,703 INFO L93 Difference]: Finished difference Result 4075 states and 4887 transitions. [2025-03-08 21:08:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:08:32,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2025-03-08 21:08:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:32,713 INFO L225 Difference]: With dead ends: 4075 [2025-03-08 21:08:32,713 INFO L226 Difference]: Without dead ends: 4073 [2025-03-08 21:08:32,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-03-08 21:08:32,715 INFO L435 NwaCegarLoop]: 1390 mSDtfsCounter, 1186 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 4358 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-03-08 21:08:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 4358 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2025-03-08 21:08:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 4071. [2025-03-08 21:08:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 2782 states have (on average 1.1441409058231489) internal successors, (3183), 2867 states have internal predecessors, (3183), 847 states have call successors, (847), 430 states have call predecessors, (847), 427 states have return successors, (847), 821 states have call predecessors, (847), 845 states have call successors, (847) [2025-03-08 21:08:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 4877 transitions. [2025-03-08 21:08:32,980 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 4877 transitions. Word has length 175 [2025-03-08 21:08:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:32,980 INFO L471 AbstractCegarLoop]: Abstraction has 4071 states and 4877 transitions. [2025-03-08 21:08:32,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 21:08:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 4877 transitions. [2025-03-08 21:08:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 21:08:32,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:32,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:08:32,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 21:08:32,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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 30 more)] === [2025-03-08 21:08:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1622014101, now seen corresponding path program 1 times [2025-03-08 21:08:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904116354] [2025-03-08 21:08:32,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:33,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 21:08:33,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 21:08:33,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:33,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 21:08:33,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:33,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904116354] [2025-03-08 21:08:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904116354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:08:33,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:08:33,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:08:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176752838] [2025-03-08 21:08:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:08:33,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:08:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:33,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:08:33,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:08:33,530 INFO L87 Difference]: Start difference. First operand 4071 states and 4877 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, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:08:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:08:33,755 INFO L93 Difference]: Finished difference Result 4071 states and 4877 transitions. [2025-03-08 21:08:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:08:33,756 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, (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 156 [2025-03-08 21:08:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:08:33,765 INFO L225 Difference]: With dead ends: 4071 [2025-03-08 21:08:33,765 INFO L226 Difference]: Without dead ends: 4069 [2025-03-08 21:08:33,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:08:33,766 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 1310 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:08:33,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 2709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 21:08:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states. [2025-03-08 21:08:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 4069. [2025-03-08 21:08:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4069 states, 2781 states have (on average 1.1434735706580368) internal successors, (3180), 2865 states have internal predecessors, (3180), 847 states have call successors, (847), 430 states have call predecessors, (847), 427 states have return successors, (847), 821 states have call predecessors, (847), 845 states have call successors, (847) [2025-03-08 21:08:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 4874 transitions. [2025-03-08 21:08:34,019 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 4874 transitions. Word has length 156 [2025-03-08 21:08:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:08:34,019 INFO L471 AbstractCegarLoop]: Abstraction has 4069 states and 4874 transitions. [2025-03-08 21:08:34,019 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, (24), 2 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 21:08:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 4874 transitions. [2025-03-08 21:08:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 21:08:34,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:08:34,021 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 21:08:34,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 21:08:34,021 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting nfnl_log_pernetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-08 21:08:34,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:08:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1925797616, now seen corresponding path program 1 times [2025-03-08 21:08:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:08:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223338129] [2025-03-08 21:08:34,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:08:34,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 21:08:34,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 21:08:34,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:34,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-08 21:08:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:08:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223338129] [2025-03-08 21:08:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223338129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:08:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199800780] [2025-03-08 21:08:34,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:08:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:08:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:08:34,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:08:34,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:08:35,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 21:08:35,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 21:08:35,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:08:35,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:08:35,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 1908 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 21:08:35,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:08:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 21:08:36,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:08:36,783 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-08 21:08:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199800780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:08:36,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:08:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2025-03-08 21:08:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815174517] [2025-03-08 21:08:36,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:08:36,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 21:08:36,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:08:36,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 21:08:36,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:08:36,785 INFO L87 Difference]: Start difference. First operand 4069 states and 4874 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 10 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (47), 10 states have call predecessors, (47), 10 states have call successors, (47) [2025-03-08 21:08:40,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []