./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---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-?-8fc3dc6-m [2025-03-17 10:14:47,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:14:47,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 10:14:47,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:14:47,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:14:47,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:14:47,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:14:47,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:14:47,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:14:47,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:14:47,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:14:47,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:14:47,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:14:47,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:14:47,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:14:47,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:14:47,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:14:47,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:14:47,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:14:47,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:14:47,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:14:47,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:14:47,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:14:47,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:14:47,477 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-17 10:14:47,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:14:47,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:14:47,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:14:47,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:14:47,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:14:47,709 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-17 10:14:48,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6125cec/6b4744cb74424df3a53c4753d41bfd2f/FLAG239686d7d [2025-03-17 10:14:49,369 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:14:49,370 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-17 10:14:49,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6125cec/6b4744cb74424df3a53c4753d41bfd2f/FLAG239686d7d [2025-03-17 10:14:49,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd6125cec/6b4744cb74424df3a53c4753d41bfd2f [2025-03-17 10:14:49,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:14:49,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:14:49,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:14:49,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:14:49,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:14:49,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:14:49" (1/1) ... [2025-03-17 10:14:49,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373f1443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:49, skipping insertion in model container [2025-03-17 10:14:49,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:14:49" (1/1) ... [2025-03-17 10:14:49,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:14:52,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:14:52,180 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:14:52,292 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-17 10:14:52,294 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-17 10:14:52,294 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-17 10:14:52,295 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-17 10:14:52,309 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-17 10:14:52,309 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-17 10:14:52,310 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-17 10:14:52,332 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-17 10:14:52,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override 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-17 10:14:52,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:14:52,604 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: __cmpxchg_wrong_size [2025-03-17 10:14:52,611 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:14:52,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52 WrapperNode [2025-03-17 10:14:52,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:14:52,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:14:52,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:14:52,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:14:52,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:52,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:52,829 INFO L138 Inliner]: procedures = 618, calls = 1465, calls flagged for inlining = 276, calls inlined = 181, statements flattened = 2717 [2025-03-17 10:14:52,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:14:52,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:14:52,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:14:52,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:14:52,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:52,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:52,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,153 INFO L175 MemorySlicer]: Split 248 memory accesses to 24 slices as follows [3, 16, 1, 6, 4, 31, 1, 7, 1, 4, 103, 1, 12, 3, 8, 1, 2, 10, 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, 0, 6, 4, 0, 0, 7, 0, 0, 4, 0, 0, 0, 0, 1, 2, 0, 0, 4, 0, 0, 0, 4]. The 112 writes are split as follows [0, 12, 0, 0, 0, 31, 0, 0, 0, 0, 47, 0, 0, 0, 0, 0, 0, 3, 0, 0, 19, 0, 0, 0]. [2025-03-17 10:14:53,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:14:53,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:14:53,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:14:53,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:14:53,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (1/1) ... [2025-03-17 10:14:53,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:14:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:14:53,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:14:53,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:14:53,328 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_total_size [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_total_size [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure seq_release_net [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_release_net [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 10:14:53,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:14:53,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_send [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_send [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure instance_put [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_put [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure nf_log_unregister [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure nf_log_unregister [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-17 10:14:53,330 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-17 10:14:53,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure skb_tailroom [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_tailroom [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-17 10:14:53,331 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 10:14:53,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-17 10:14:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2025-03-17 10:14:53,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2025-03-17 10:14:53,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure nfnetlink_subsys_unregister [2025-03-17 10:14:53,333 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnetlink_subsys_unregister [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:14:53,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-17 10:14:53,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure seq_file_net [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_file_net [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_130 [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_130 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_put [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_put [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_138 [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_138 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure instance_lookup_get [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_lookup_get [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-17 10:14:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure seq_show [2025-03-17 10:14:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_show [2025-03-17 10:14:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:14:53,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2025-03-17 10:14:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:14:53,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-17 10:14:53,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_nfulnl_instance [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2025-03-17 10:14:53,336 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-17 10:14:53,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-17 10:14:53,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure nful_open [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nful_open [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netlink_unregister_notifier [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netlink_unregister_notifier [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure nla_get_be32 [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_get_be32 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_pernet [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_pernet [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_for_read_section [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_for_read_section [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure nlmsg_data [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nlmsg_data [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:14:53,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-17 10:14:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock_bh [2025-03-17 10:14:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock_bh [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 10:14:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 10:14:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 10:14:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure nfnl_log_net_exit [2025-03-17 10:14:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure nfnl_log_net_exit [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure nla_data [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure nla_data [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_lookup [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_lookup [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_132 [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_132 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_139 [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_139 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure netlink_unregister_notifier [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure netlink_unregister_notifier [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2025-03-17 10:14:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2025-03-17 10:14:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_rcu_suspicious [2025-03-17 10:14:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_rcu_suspicious [2025-03-17 10:14:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_bh_held [2025-03-17 10:14:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_bh_held [2025-03-17 10:14:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure __instance_destroy [2025-03-17 10:14:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __instance_destroy [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_nfulnl_instance [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure instance_hashfn [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure instance_hashfn [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure __nfulnl_flush [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __nfulnl_flush [2025-03-17 10:14:53,344 INFO L130 BoogieDeclarations]: Found specification of procedure get_next [2025-03-17 10:14:53,344 INFO L138 BoogieDeclarations]: Found implementation of procedure get_next [2025-03-17 10:14:53,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:14:53,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:14:53,979 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15709: havoc #t~nondet826; [2025-03-17 10:14:53,982 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 10:14:54,002 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15697: havoc seq_open_net_#t~nondet823#1; [2025-03-17 10:14:54,007 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15589: havoc #t~nondet800; [2025-03-17 10:14:54,031 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc #t~nondet825; [2025-03-17 10:14:54,037 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10006: #res#1 := ~arg0#1; [2025-03-17 10:14:54,057 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~mem124; [2025-03-17 10:14:54,100 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15660: havoc nfnetlink_unicast_#t~nondet812#1; [2025-03-17 10:14:54,104 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7035: havoc #t~mem17; [2025-03-17 10:14:54,222 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7262: havoc skb_is_nonlinear_#t~mem56#1; [2025-03-17 10:14:54,223 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7273: havoc #t~ite62#1;havoc #t~mem60#1;havoc #t~mem61#1; [2025-03-17 10:14:54,225 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15671: havoc #t~nondet817; [2025-03-17 10:14:54,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6976: havoc #t~bitwise4; [2025-03-17 10:14:54,347 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15656: havoc #t~nondet811; [2025-03-17 10:14:54,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15628: havoc #t~nondet806; [2025-03-17 10:14:54,366 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15682: havoc #t~nondet820; [2025-03-17 10:14:54,369 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7311: havoc #t~mem84.base, #t~mem84.offset;havoc #t~mem85.base, #t~mem85.offset; [2025-03-17 10:14:54,399 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15564: havoc __nlmsg_put_#t~ret799#1.base, __nlmsg_put_#t~ret799#1.offset; [2025-03-17 10:14:54,462 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15678: havoc #t~nondet819; [2025-03-17 10:14:54,480 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15701: havoc seq_printf_#t~nondet824#1; [2025-03-17 10:14:54,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9505-1: ldv_del_timer_#res#1 := ldv_del_timer_~arg0#1; [2025-03-17 10:14:54,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10559-1: ldv_del_timer_148_#res#1 := ldv_del_timer_148_~ldv_func_res~0#1; [2025-03-17 10:14:54,503 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15593: havoc del_timer_#t~nondet801#1; [2025-03-17 10:14:59,771 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15693: havoc seq_lseek_#t~nondet822#1; [2025-03-17 10:14:59,771 INFO L1322 $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-17 10:14:59,771 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15632: havoc nf_log_bind_pf_#t~nondet807#1; [2025-03-17 10:14:59,771 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7011: havoc hlist_empty_#t~mem8#1.base, hlist_empty_#t~mem8#1.offset; [2025-03-17 10:14:59,772 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7343: havoc read_pnet_#t~mem88#1.base, read_pnet_#t~mem88#1.offset; [2025-03-17 10:14:59,772 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15636: havoc nf_log_register_#t~nondet808#1; [2025-03-17 10:14:59,772 INFO L1322 $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-17 10:14:59,772 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7479: havoc nla_get_be16_#t~mem126#1; [2025-03-17 10:14:59,773 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15674: havoc proc_create_data_#t~ret818#1.base, proc_create_data_#t~ret818#1.offset; [2025-03-17 10:14:59,773 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9994-1: ldv_netlink_register_notifier_#res#1 := ldv_netlink_register_notifier_~arg0#1; [2025-03-17 10:14:59,773 INFO L1322 $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-17 10:14:59,773 INFO L1322 $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-17 10:14:59,773 INFO L1322 $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-17 10:14:59,773 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15652: havoc nfnetlink_subsys_register_#t~nondet810#1; [2025-03-17 10:14:59,773 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15686: havoc register_pernet_subsys_#t~nondet821#1; [2025-03-17 10:14:59,773 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15624: havoc netlink_register_notifier_#t~nondet805#1; [2025-03-17 10:14:59,773 INFO L1322 $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-17 10:15:00,105 INFO L? ?]: Removed 1353 outVars from TransFormulas that were not future-live. [2025-03-17 10:15:00,106 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:15:00,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:15:00,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:15:00,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:15:00 BoogieIcfgContainer [2025-03-17 10:15:00,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:15:00,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:15:00,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:15:00,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:15:00,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:14:49" (1/3) ... [2025-03-17 10:15:00,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e579e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:15:00, skipping insertion in model container [2025-03-17 10:15:00,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:14:52" (2/3) ... [2025-03-17 10:15:00,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e579e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:15:00, skipping insertion in model container [2025-03-17 10:15:00,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:15:00" (3/3) ... [2025-03-17 10:15:00,147 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i [2025-03-17 10:15:00,159 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:15:00,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.0-rc1---net--netfilter--nfnetlink_log.ko.cil.i that has 86 procedures, 1032 locations, 1 initial locations, 1 loop locations, and 32 error locations. [2025-03-17 10:15:00,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:15:00,243 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;@6cfe56a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:15:00,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-17 10:15:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 1031 states, 651 states have (on average 1.2872503840245775) internal successors, (838), 708 states have internal predecessors, (838), 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-17 10:15:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:15:00,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:00,259 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] [2025-03-17 10:15:00,260 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-17 10:15:00,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2056806075, now seen corresponding path program 1 times [2025-03-17 10:15:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6607640] [2025-03-17 10:15:00,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:15:01,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:15:01,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:01,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:01,735 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-17 10:15:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6607640] [2025-03-17 10:15:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6607640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:01,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770565147] [2025-03-17 10:15:01,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:01,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:01,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:01,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:01,758 INFO L87 Difference]: Start difference. First operand has 1031 states, 651 states have (on average 1.2872503840245775) internal successors, (838), 708 states have internal predecessors, (838), 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 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-17 10:15:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:01,967 INFO L93 Difference]: Finished difference Result 2032 states and 2768 transitions. [2025-03-17 10:15:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:01,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (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 65 [2025-03-17 10:15:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:01,982 INFO L225 Difference]: With dead ends: 2032 [2025-03-17 10:15:01,982 INFO L226 Difference]: Without dead ends: 1007 [2025-03-17 10:15:01,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:01,994 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 1280 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2611 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-17 10:15:01,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2611 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-17 10:15:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2025-03-17 10:15:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 636 states have (on average 1.221698113207547) internal successors, (777), 687 states have internal predecessors, (777), 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-17 10:15:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1291 transitions. [2025-03-17 10:15:02,112 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1291 transitions. Word has length 65 [2025-03-17 10:15:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:02,113 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1291 transitions. [2025-03-17 10:15:02,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (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-17 10:15:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1291 transitions. [2025-03-17 10:15:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 10:15:02,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:02,117 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] [2025-03-17 10:15:02,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:15:02,118 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-17 10:15:02,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2002638835, now seen corresponding path program 1 times [2025-03-17 10:15:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:02,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59589278] [2025-03-17 10:15:02,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:15:02,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:15:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:02,818 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-17 10:15:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:02,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59589278] [2025-03-17 10:15:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59589278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576746095] [2025-03-17 10:15:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:02,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:02,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:02,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:02,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:02,821 INFO L87 Difference]: Start difference. First operand 1007 states and 1291 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:15:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:02,916 INFO L93 Difference]: Finished difference Result 1007 states and 1291 transitions. [2025-03-17 10:15:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2025-03-17 10:15:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:02,925 INFO L225 Difference]: With dead ends: 1007 [2025-03-17 10:15:02,925 INFO L226 Difference]: Without dead ends: 1005 [2025-03-17 10:15:02,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:02,926 INFO L435 NwaCegarLoop]: 1286 mSDtfsCounter, 1259 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 2571 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-17 10:15:02,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 2571 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-03-17 10:15:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2025-03-17 10:15:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 635 states have (on average 1.220472440944882) internal successors, (775), 685 states have internal predecessors, (775), 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-17 10:15:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1289 transitions. [2025-03-17 10:15:02,979 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1289 transitions. Word has length 71 [2025-03-17 10:15:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:02,980 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1289 transitions. [2025-03-17 10:15:02,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 10:15:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1289 transitions. [2025-03-17 10:15:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 10:15:02,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:02,984 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:15:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:15:02,984 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-17 10:15:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 457047694, now seen corresponding path program 1 times [2025-03-17 10:15:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789273474] [2025-03-17 10:15:02,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 10:15:03,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:15:03,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:03,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:03,653 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-17 10:15:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789273474] [2025-03-17 10:15:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789273474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815355790] [2025-03-17 10:15:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:03,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:03,655 INFO L87 Difference]: Start difference. First operand 1005 states and 1289 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 10:15:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:03,736 INFO L93 Difference]: Finished difference Result 1005 states and 1289 transitions. [2025-03-17 10:15:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2025-03-17 10:15:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:03,742 INFO L225 Difference]: With dead ends: 1005 [2025-03-17 10:15:03,743 INFO L226 Difference]: Without dead ends: 1003 [2025-03-17 10:15:03,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:03,744 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 1256 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 2567 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-17 10:15:03,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 2567 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-03-17 10:15:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-03-17 10:15:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 634 states have (on average 1.2192429022082019) internal successors, (773), 683 states have internal predecessors, (773), 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-17 10:15:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1287 transitions. [2025-03-17 10:15:03,804 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1287 transitions. Word has length 77 [2025-03-17 10:15:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1287 transitions. [2025-03-17 10:15:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 10:15:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1287 transitions. [2025-03-17 10:15:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 10:15:03,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:03,808 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] [2025-03-17 10:15:03,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:15:03,808 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-17 10:15:03,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1515274678, now seen corresponding path program 1 times [2025-03-17 10:15:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198391422] [2025-03-17 10:15:03,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:04,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 10:15:04,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 10:15:04,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:04,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:04,761 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-17 10:15:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198391422] [2025-03-17 10:15:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198391422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:04,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:04,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:15:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279741233] [2025-03-17 10:15:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:04,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:15:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:04,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:15:04,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:04,763 INFO L87 Difference]: Start difference. First operand 1003 states and 1287 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-17 10:15:08,780 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 [] [2025-03-17 10:15:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:10,071 INFO L93 Difference]: Finished difference Result 1667 states and 2095 transitions. [2025-03-17 10:15:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 93 [2025-03-17 10:15:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:10,084 INFO L225 Difference]: With dead ends: 1667 [2025-03-17 10:15:10,084 INFO L226 Difference]: Without dead ends: 1665 [2025-03-17 10:15:10,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:15:10,085 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 792 mSDsluCounter, 3756 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 5176 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-17 10:15:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 5176 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 10:15:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-17 10:15:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1472. [2025-03-17 10:15:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 927 states have (on average 1.2071197411003236) internal successors, (1119), 992 states have internal predecessors, (1119), 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-17 10:15:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1889 transitions. [2025-03-17 10:15:10,160 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1889 transitions. Word has length 93 [2025-03-17 10:15:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:10,160 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 1889 transitions. [2025-03-17 10:15:10,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-17 10:15:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1889 transitions. [2025-03-17 10:15:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 10:15:10,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:10,161 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] [2025-03-17 10:15:10,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:15:10,162 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-17 10:15:10,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1415041292, now seen corresponding path program 1 times [2025-03-17 10:15:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:10,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792946446] [2025-03-17 10:15:10,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:10,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:10,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 10:15:10,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:15:10,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:10,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:10,706 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-17 10:15:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792946446] [2025-03-17 10:15:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792946446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:10,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:10,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117422237] [2025-03-17 10:15:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:10,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:10,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:10,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:10,709 INFO L87 Difference]: Start difference. First operand 1472 states and 1889 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:15:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:10,796 INFO L93 Difference]: Finished difference Result 1472 states and 1889 transitions. [2025-03-17 10:15:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:10,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-17 10:15:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:10,805 INFO L225 Difference]: With dead ends: 1472 [2025-03-17 10:15:10,805 INFO L226 Difference]: Without dead ends: 1470 [2025-03-17 10:15:10,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:10,807 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 1253 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2563 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-17 10:15:10,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2563 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2025-03-17 10:15:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1470. [2025-03-17 10:15:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 926 states have (on average 1.2062634989200864) internal successors, (1117), 990 states have internal predecessors, (1117), 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-17 10:15:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1887 transitions. [2025-03-17 10:15:10,883 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1887 transitions. Word has length 83 [2025-03-17 10:15:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:10,884 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 1887 transitions. [2025-03-17 10:15:10,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 10:15:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1887 transitions. [2025-03-17 10:15:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 10:15:10,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:10,887 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] [2025-03-17 10:15:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:15:10,888 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-17 10:15:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1200779847, now seen corresponding path program 1 times [2025-03-17 10:15:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513527829] [2025-03-17 10:15:10,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:15:11,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:15:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:11,477 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-17 10:15:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513527829] [2025-03-17 10:15:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513527829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:11,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070025798] [2025-03-17 10:15:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:11,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:11,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:11,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:11,480 INFO L87 Difference]: Start difference. First operand 1470 states and 1887 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:15:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:11,584 INFO L93 Difference]: Finished difference Result 1470 states and 1887 transitions. [2025-03-17 10:15:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-17 10:15:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:11,593 INFO L225 Difference]: With dead ends: 1470 [2025-03-17 10:15:11,593 INFO L226 Difference]: Without dead ends: 1468 [2025-03-17 10:15:11,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:11,595 INFO L435 NwaCegarLoop]: 1280 mSDtfsCounter, 1250 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 2559 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-17 10:15:11,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 2559 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-17 10:15:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-03-17 10:15:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 925 states have (on average 1.2054054054054053) internal successors, (1115), 988 states have internal predecessors, (1115), 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-17 10:15:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1885 transitions. [2025-03-17 10:15:11,675 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1885 transitions. Word has length 89 [2025-03-17 10:15:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:11,675 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1885 transitions. [2025-03-17 10:15:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-17 10:15:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1885 transitions. [2025-03-17 10:15:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 10:15:11,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:11,678 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] [2025-03-17 10:15:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:15:11,678 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-17 10:15:11,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash -703020838, now seen corresponding path program 1 times [2025-03-17 10:15:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619371083] [2025-03-17 10:15:11,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 10:15:12,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:15:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:12,200 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-17 10:15:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619371083] [2025-03-17 10:15:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619371083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638193663] [2025-03-17 10:15:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:12,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:12,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:12,203 INFO L87 Difference]: Start difference. First operand 1468 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:15:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:12,327 INFO L93 Difference]: Finished difference Result 1468 states and 1885 transitions. [2025-03-17 10:15:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-03-17 10:15:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:12,338 INFO L225 Difference]: With dead ends: 1468 [2025-03-17 10:15:12,338 INFO L226 Difference]: Without dead ends: 1466 [2025-03-17 10:15:12,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:12,340 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 1247 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 2555 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-17 10:15:12,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 2555 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-17 10:15:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2025-03-17 10:15:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 924 states have (on average 1.2045454545454546) internal successors, (1113), 986 states have internal predecessors, (1113), 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-17 10:15:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1883 transitions. [2025-03-17 10:15:12,461 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1883 transitions. Word has length 95 [2025-03-17 10:15:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:12,461 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 1883 transitions. [2025-03-17 10:15:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 10:15:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1883 transitions. [2025-03-17 10:15:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 10:15:12,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:12,463 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] [2025-03-17 10:15:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:15:12,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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-17 10:15:12,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1547615327, now seen corresponding path program 1 times [2025-03-17 10:15:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:12,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933880654] [2025-03-17 10:15:12,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:12,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 10:15:12,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 10:15:12,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:12,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:13,348 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-17 10:15:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933880654] [2025-03-17 10:15:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933880654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:13,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:13,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:15:13,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219967195] [2025-03-17 10:15:13,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:13,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:15:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:13,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:15:13,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:13,350 INFO L87 Difference]: Start difference. First operand 1466 states and 1883 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-17 10:15:13,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:13,608 INFO L93 Difference]: Finished difference Result 1638 states and 2073 transitions. [2025-03-17 10:15:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:13,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 111 [2025-03-17 10:15:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:13,622 INFO L225 Difference]: With dead ends: 1638 [2025-03-17 10:15:13,623 INFO L226 Difference]: Without dead ends: 1636 [2025-03-17 10:15:13,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:15:13,625 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1110 mSDsluCounter, 3139 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 4544 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-17 10:15:13,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 4544 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:15:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-03-17 10:15:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1624. [2025-03-17 10:15:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1033 states have (on average 1.2052274927395934) internal successors, (1245), 1095 states have internal predecessors, (1245), 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-17 10:15:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2065 transitions. [2025-03-17 10:15:13,729 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2065 transitions. Word has length 111 [2025-03-17 10:15:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2065 transitions. [2025-03-17 10:15:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-17 10:15:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2065 transitions. [2025-03-17 10:15:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 10:15:13,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:13,734 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] [2025-03-17 10:15:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:15:13,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-17 10:15:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -297509850, now seen corresponding path program 1 times [2025-03-17 10:15:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991074460] [2025-03-17 10:15:13,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 10:15:14,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 10:15:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:14,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:14,288 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-17 10:15:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991074460] [2025-03-17 10:15:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991074460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091642667] [2025-03-17 10:15:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:14,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:14,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:14,290 INFO L87 Difference]: Start difference. First operand 1624 states and 2065 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:15:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:14,391 INFO L93 Difference]: Finished difference Result 1624 states and 2065 transitions. [2025-03-17 10:15:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:14,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-03-17 10:15:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:14,400 INFO L225 Difference]: With dead ends: 1624 [2025-03-17 10:15:14,400 INFO L226 Difference]: Without dead ends: 1622 [2025-03-17 10:15:14,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:14,402 INFO L435 NwaCegarLoop]: 1276 mSDtfsCounter, 1244 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 2551 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-17 10:15:14,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 2551 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-17 10:15:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2025-03-17 10:15:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1032 states have (on average 1.2044573643410852) internal successors, (1243), 1093 states have internal predecessors, (1243), 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-17 10:15:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2063 transitions. [2025-03-17 10:15:14,486 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2063 transitions. Word has length 101 [2025-03-17 10:15:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2063 transitions. [2025-03-17 10:15:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 10:15:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2063 transitions. [2025-03-17 10:15:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 10:15:14,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:14,489 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] [2025-03-17 10:15:14,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:15:14,490 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-17 10:15:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2002420687, now seen corresponding path program 1 times [2025-03-17 10:15:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247583668] [2025-03-17 10:15:14,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 10:15:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 10:15:14,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:14,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:14,996 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-17 10:15:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247583668] [2025-03-17 10:15:14,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247583668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:14,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:14,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506016384] [2025-03-17 10:15:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:14,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:14,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:14,998 INFO L87 Difference]: Start difference. First operand 1622 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:15:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:15,093 INFO L93 Difference]: Finished difference Result 1622 states and 2063 transitions. [2025-03-17 10:15:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-03-17 10:15:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:15,101 INFO L225 Difference]: With dead ends: 1622 [2025-03-17 10:15:15,101 INFO L226 Difference]: Without dead ends: 1620 [2025-03-17 10:15:15,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:15,102 INFO L435 NwaCegarLoop]: 1274 mSDtfsCounter, 1241 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2547 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-17 10:15:15,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2547 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2025-03-17 10:15:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2025-03-17 10:15:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1031 states have (on average 1.2036857419980602) internal successors, (1241), 1091 states have internal predecessors, (1241), 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-17 10:15:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2061 transitions. [2025-03-17 10:15:15,187 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2061 transitions. Word has length 107 [2025-03-17 10:15:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:15,188 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 2061 transitions. [2025-03-17 10:15:15,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:15:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2061 transitions. [2025-03-17 10:15:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 10:15:15,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:15,191 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] [2025-03-17 10:15:15,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:15:15,191 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-17 10:15:15,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1676434013, now seen corresponding path program 1 times [2025-03-17 10:15:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:15,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243869038] [2025-03-17 10:15:15,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:15,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 10:15:15,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 10:15:15,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:16,655 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-17 10:15:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243869038] [2025-03-17 10:15:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243869038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:15:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850433271] [2025-03-17 10:15:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:16,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:16,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:15:16,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:15:16,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:15:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 10:15:17,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 10:15:17,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:17,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:17,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:15:17,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:15:17,840 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-17 10:15:17,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:15:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850433271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:15:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-17 10:15:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478793551] [2025-03-17 10:15:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:15:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:17,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:15:17,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:15:17,843 INFO L87 Difference]: Start difference. First operand 1620 states and 2061 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-17 10:15:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:18,365 INFO L93 Difference]: Finished difference Result 3085 states and 3895 transitions. [2025-03-17 10:15:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 129 [2025-03-17 10:15:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:18,376 INFO L225 Difference]: With dead ends: 3085 [2025-03-17 10:15:18,376 INFO L226 Difference]: Without dead ends: 1628 [2025-03-17 10:15:18,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:15:18,382 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 33 mSDsluCounter, 3671 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4925 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-17 10:15:18,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4925 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:15:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-03-17 10:15:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1626. [2025-03-17 10:15:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1035 states have (on average 1.2028985507246377) internal successors, (1245), 1095 states have internal predecessors, (1245), 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-17 10:15:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2069 transitions. [2025-03-17 10:15:18,538 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2069 transitions. Word has length 129 [2025-03-17 10:15:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2069 transitions. [2025-03-17 10:15:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-17 10:15:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2069 transitions. [2025-03-17 10:15:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 10:15:18,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:18,542 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] [2025-03-17 10:15:18,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:15:18,746 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-17 10:15:18,747 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-17 10:15:18,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash 180972299, now seen corresponding path program 1 times [2025-03-17 10:15:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:18,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692460531] [2025-03-17 10:15:18,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:19,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 10:15:19,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 10:15:19,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:19,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:19,402 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-17 10:15:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692460531] [2025-03-17 10:15:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692460531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322936947] [2025-03-17 10:15:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:19,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:19,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:19,405 INFO L87 Difference]: Start difference. First operand 1626 states and 2069 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:15:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:19,512 INFO L93 Difference]: Finished difference Result 1626 states and 2069 transitions. [2025-03-17 10:15:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (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 109 [2025-03-17 10:15:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:19,523 INFO L225 Difference]: With dead ends: 1626 [2025-03-17 10:15:19,523 INFO L226 Difference]: Without dead ends: 1624 [2025-03-17 10:15:19,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:19,526 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 1237 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 2543 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-17 10:15:19,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 2543 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2025-03-17 10:15:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2025-03-17 10:15:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1034 states have (on average 1.202127659574468) internal successors, (1243), 1093 states have internal predecessors, (1243), 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-17 10:15:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2067 transitions. [2025-03-17 10:15:19,658 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2067 transitions. Word has length 109 [2025-03-17 10:15:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2067 transitions. [2025-03-17 10:15:19,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 10:15:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2067 transitions. [2025-03-17 10:15:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 10:15:19,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:19,660 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] [2025-03-17 10:15:19,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:15:19,661 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-17 10:15:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1617526960, now seen corresponding path program 1 times [2025-03-17 10:15:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:19,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626882907] [2025-03-17 10:15:19,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:19,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:20,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 10:15:20,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 10:15:20,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:20,331 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-17 10:15:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626882907] [2025-03-17 10:15:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626882907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284328002] [2025-03-17 10:15:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:20,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:20,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:20,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:20,333 INFO L87 Difference]: Start difference. First operand 1624 states and 2067 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:15:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:20,630 INFO L93 Difference]: Finished difference Result 2456 states and 3062 transitions. [2025-03-17 10:15:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2025-03-17 10:15:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:20,642 INFO L225 Difference]: With dead ends: 2456 [2025-03-17 10:15:20,642 INFO L226 Difference]: Without dead ends: 2454 [2025-03-17 10:15:20,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:20,645 INFO L435 NwaCegarLoop]: 1287 mSDtfsCounter, 1235 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3386 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3386 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:15:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2025-03-17 10:15:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2409. [2025-03-17 10:15:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1561 states have (on average 1.2056374119154387) internal successors, (1882), 1628 states have internal predecessors, (1882), 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-17 10:15:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3036 transitions. [2025-03-17 10:15:20,826 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3036 transitions. Word has length 115 [2025-03-17 10:15:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:20,826 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3036 transitions. [2025-03-17 10:15:20,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 10:15:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3036 transitions. [2025-03-17 10:15:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 10:15:20,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:20,828 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] [2025-03-17 10:15:20,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:15:20,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-17 10:15:20,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1581677599, now seen corresponding path program 1 times [2025-03-17 10:15:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238564028] [2025-03-17 10:15:20,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 10:15:21,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 10:15:21,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:21,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:21,344 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-17 10:15:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:21,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238564028] [2025-03-17 10:15:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238564028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:21,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:15:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802308037] [2025-03-17 10:15:21,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:15:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:21,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:15:21,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:15:21,349 INFO L87 Difference]: Start difference. First operand 2409 states and 3036 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-17 10:15:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:21,498 INFO L93 Difference]: Finished difference Result 4342 states and 5460 transitions. [2025-03-17 10:15:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:15:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 132 [2025-03-17 10:15:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:21,511 INFO L225 Difference]: With dead ends: 4342 [2025-03-17 10:15:21,511 INFO L226 Difference]: Without dead ends: 2420 [2025-03-17 10:15:21,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:15:21,518 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 13 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:21,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2538 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-17 10:15:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2410. [2025-03-17 10:15:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2410 states, 1562 states have (on average 1.20550576184379) internal successors, (1883), 1629 states have internal predecessors, (1883), 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-17 10:15:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3037 transitions. [2025-03-17 10:15:21,684 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3037 transitions. Word has length 132 [2025-03-17 10:15:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:21,686 INFO L471 AbstractCegarLoop]: Abstraction has 2410 states and 3037 transitions. [2025-03-17 10:15:21,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-17 10:15:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3037 transitions. [2025-03-17 10:15:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 10:15:21,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:21,689 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] [2025-03-17 10:15:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:15:21,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-17 10:15:21,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash 95893816, now seen corresponding path program 1 times [2025-03-17 10:15:21,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517787888] [2025-03-17 10:15:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:22,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 10:15:22,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 10:15:22,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:22,399 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-17 10:15:22,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:22,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517787888] [2025-03-17 10:15:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517787888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:22,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:22,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916735861] [2025-03-17 10:15:22,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:22,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:22,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:22,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:22,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:22,402 INFO L87 Difference]: Start difference. First operand 2410 states and 3037 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 10:15:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:22,633 INFO L93 Difference]: Finished difference Result 3422 states and 4250 transitions. [2025-03-17 10:15:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:22,634 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2025-03-17 10:15:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:22,653 INFO L225 Difference]: With dead ends: 3422 [2025-03-17 10:15:22,653 INFO L226 Difference]: Without dead ends: 3420 [2025-03-17 10:15:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:22,658 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 786 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 3638 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-17 10:15:22,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 3638 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2025-03-17 10:15:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3291. [2025-03-17 10:15:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2126 states have (on average 1.195672624647225) internal successors, (2542), 2215 states have internal predecessors, (2542), 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-17 10:15:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4122 transitions. [2025-03-17 10:15:22,882 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4122 transitions. Word has length 121 [2025-03-17 10:15:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 4122 transitions. [2025-03-17 10:15:22,882 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 10:15:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4122 transitions. [2025-03-17 10:15:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 10:15:22,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:22,884 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] [2025-03-17 10:15:22,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:15:22,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-17 10:15:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 52992174, now seen corresponding path program 1 times [2025-03-17 10:15:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:22,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907349696] [2025-03-17 10:15:22,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 10:15:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 10:15:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:23,406 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-17 10:15:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907349696] [2025-03-17 10:15:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907349696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:15:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253844624] [2025-03-17 10:15:23,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:15:23,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:15:23,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:15:24,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 10:15:24,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 10:15:24,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:24,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:24,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:15:24,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:15:24,533 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-17 10:15:24,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:15:24,744 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-17 10:15:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253844624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:15:24,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:15:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 10:15:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396459391] [2025-03-17 10:15:24,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:15:24,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:15:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:24,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:15:24,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:15:24,746 INFO L87 Difference]: Start difference. First operand 3291 states and 4122 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-17 10:15:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:25,167 INFO L93 Difference]: Finished difference Result 5824 states and 7279 transitions. [2025-03-17 10:15:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:15:25,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 137 [2025-03-17 10:15:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:25,199 INFO L225 Difference]: With dead ends: 5824 [2025-03-17 10:15:25,201 INFO L226 Difference]: Without dead ends: 3324 [2025-03-17 10:15:25,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 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-17 10:15:25,213 INFO L435 NwaCegarLoop]: 1271 mSDtfsCounter, 71 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:25,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2570 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:15:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2025-03-17 10:15:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3324. [2025-03-17 10:15:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3324 states, 2156 states have (on average 1.1985157699443414) internal successors, (2584), 2248 states have internal predecessors, (2584), 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-17 10:15:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4170 transitions. [2025-03-17 10:15:25,531 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4170 transitions. Word has length 137 [2025-03-17 10:15:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:25,532 INFO L471 AbstractCegarLoop]: Abstraction has 3324 states and 4170 transitions. [2025-03-17 10:15:25,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-17 10:15:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4170 transitions. [2025-03-17 10:15:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 10:15:25,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:25,535 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] [2025-03-17 10:15:25,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:15:25,735 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,SelfDestructingSolverStorable15 [2025-03-17 10:15:25,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-17 10:15:25,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1429606569, now seen corresponding path program 1 times [2025-03-17 10:15:25,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26929491] [2025-03-17 10:15:25,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 10:15:26,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 10:15:26,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:26,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:26,269 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-17 10:15:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:26,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26929491] [2025-03-17 10:15:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26929491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:26,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395151085] [2025-03-17 10:15:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:26,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:26,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:26,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:26,271 INFO L87 Difference]: Start difference. First operand 3324 states and 4170 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, (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-17 10:15:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:26,483 INFO L93 Difference]: Finished difference Result 3370 states and 4203 transitions. [2025-03-17 10:15:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:26,483 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, (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 138 [2025-03-17 10:15:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:26,499 INFO L225 Difference]: With dead ends: 3370 [2025-03-17 10:15:26,499 INFO L226 Difference]: Without dead ends: 3368 [2025-03-17 10:15:26,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:26,502 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 789 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 3638 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:26,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 3638 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:15:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2025-03-17 10:15:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 3324. [2025-03-17 10:15:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3324 states, 2156 states have (on average 1.1971243042671613) internal successors, (2581), 2248 states have internal predecessors, (2581), 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-17 10:15:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4167 transitions. [2025-03-17 10:15:26,704 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4167 transitions. Word has length 138 [2025-03-17 10:15:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:26,705 INFO L471 AbstractCegarLoop]: Abstraction has 3324 states and 4167 transitions. [2025-03-17 10:15:26,705 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, (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-17 10:15:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4167 transitions. [2025-03-17 10:15:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 10:15:26,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:26,706 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] [2025-03-17 10:15:26,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:15:26,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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-17 10:15:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 880992801, now seen corresponding path program 1 times [2025-03-17 10:15:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094097344] [2025-03-17 10:15:26,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 10:15:27,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 10:15:27,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:27,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:27,212 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-17 10:15:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:27,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094097344] [2025-03-17 10:15:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094097344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:27,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:27,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:27,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7946653] [2025-03-17 10:15:27,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:27,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:27,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:27,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:27,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:27,214 INFO L87 Difference]: Start difference. First operand 3324 states and 4167 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 10:15:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:27,421 INFO L93 Difference]: Finished difference Result 3324 states and 4167 transitions. [2025-03-17 10:15:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2025-03-17 10:15:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:27,433 INFO L225 Difference]: With dead ends: 3324 [2025-03-17 10:15:27,433 INFO L226 Difference]: Without dead ends: 3322 [2025-03-17 10:15:27,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:27,435 INFO L435 NwaCegarLoop]: 1269 mSDtfsCounter, 1234 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2537 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-17 10:15:27,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2537 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2025-03-17 10:15:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3322. [2025-03-17 10:15:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 2155 states have (on average 1.1962877030162413) internal successors, (2578), 2246 states have internal predecessors, (2578), 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-17 10:15:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 4164 transitions. [2025-03-17 10:15:27,610 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 4164 transitions. Word has length 127 [2025-03-17 10:15:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:27,610 INFO L471 AbstractCegarLoop]: Abstraction has 3322 states and 4164 transitions. [2025-03-17 10:15:27,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 10:15:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 4164 transitions. [2025-03-17 10:15:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 10:15:27,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:27,613 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] [2025-03-17 10:15:27,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:15:27,613 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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-17 10:15:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -537588219, now seen corresponding path program 1 times [2025-03-17 10:15:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926220666] [2025-03-17 10:15:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:27,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 10:15:27,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 10:15:27,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:27,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:28,178 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-17 10:15:28,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:28,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926220666] [2025-03-17 10:15:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926220666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169096829] [2025-03-17 10:15:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:28,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:28,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:28,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:28,180 INFO L87 Difference]: Start difference. First operand 3322 states and 4164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (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-17 10:15:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:28,493 INFO L93 Difference]: Finished difference Result 3322 states and 4164 transitions. [2025-03-17 10:15:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:28,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (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 140 [2025-03-17 10:15:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:28,504 INFO L225 Difference]: With dead ends: 3322 [2025-03-17 10:15:28,505 INFO L226 Difference]: Without dead ends: 3320 [2025-03-17 10:15:28,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:28,506 INFO L435 NwaCegarLoop]: 1267 mSDtfsCounter, 1236 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 2533 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-17 10:15:28,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 2533 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2025-03-17 10:15:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2025-03-17 10:15:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 2154 states have (on average 1.1926648096564532) internal successors, (2569), 2244 states have internal predecessors, (2569), 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-17 10:15:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4155 transitions. [2025-03-17 10:15:28,680 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4155 transitions. Word has length 140 [2025-03-17 10:15:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:28,681 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4155 transitions. [2025-03-17 10:15:28,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (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-17 10:15:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4155 transitions. [2025-03-17 10:15:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 10:15:28,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:28,684 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] [2025-03-17 10:15:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:15:28,684 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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-17 10:15:28,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1226169407, now seen corresponding path program 1 times [2025-03-17 10:15:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488285824] [2025-03-17 10:15:28,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:29,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 10:15:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 10:15:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:29,946 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-17 10:15:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:29,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488285824] [2025-03-17 10:15:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488285824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:15:29,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789046578] [2025-03-17 10:15:29,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:15:29,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:15:29,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:15:30,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 10:15:31,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 10:15:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:31,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 10:15:31,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:15:31,558 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-17 10:15:31,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:15:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789046578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:15:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2025-03-17 10:15:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448986506] [2025-03-17 10:15:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:15:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:31,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:15:31,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-17 10:15:31,559 INFO L87 Difference]: Start difference. First operand 3320 states and 4155 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-17 10:15:35,573 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 [] [2025-03-17 10:15:39,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 10:15:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:43,447 INFO L93 Difference]: Finished difference Result 3344 states and 4171 transitions. [2025-03-17 10:15:43,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:15:43,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 142 [2025-03-17 10:15:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:43,460 INFO L225 Difference]: With dead ends: 3344 [2025-03-17 10:15:43,460 INFO L226 Difference]: Without dead ends: 3342 [2025-03-17 10:15:43,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 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-17 10:15:43,465 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 1263 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 448 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:43,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1906 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2490 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2025-03-17 10:15:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2025-03-17 10:15:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3342. [2025-03-17 10:15:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 2169 states have (on average 1.1876440756108806) internal successors, (2576), 2258 states have internal predecessors, (2576), 793 states have call successors, (793), 364 states have call predecessors, (793), 361 states have return successors, (793), 767 states have call predecessors, (793), 791 states have call successors, (793) [2025-03-17 10:15:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 4162 transitions. [2025-03-17 10:15:43,660 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 4162 transitions. Word has length 142 [2025-03-17 10:15:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:43,660 INFO L471 AbstractCegarLoop]: Abstraction has 3342 states and 4162 transitions. [2025-03-17 10:15:43,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-17 10:15:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 4162 transitions. [2025-03-17 10:15:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 10:15:43,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:43,662 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] [2025-03-17 10:15:43,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 10:15:43,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:43,863 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 30 more)] === [2025-03-17 10:15:43,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1975777293, now seen corresponding path program 1 times [2025-03-17 10:15:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056045069] [2025-03-17 10:15:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:44,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 10:15:44,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 10:15:44,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:44,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:44,340 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-17 10:15:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056045069] [2025-03-17 10:15:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056045069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:44,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:44,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860755246] [2025-03-17 10:15:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:44,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:44,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:44,342 INFO L87 Difference]: Start difference. First operand 3342 states and 4162 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 10:15:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:44,576 INFO L93 Difference]: Finished difference Result 3655 states and 4496 transitions. [2025-03-17 10:15:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2025-03-17 10:15:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:44,590 INFO L225 Difference]: With dead ends: 3655 [2025-03-17 10:15:44,590 INFO L226 Difference]: Without dead ends: 3653 [2025-03-17 10:15:44,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:44,593 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 727 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 4040 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:15:44,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 4040 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:15:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2025-03-17 10:15:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 3530. [2025-03-17 10:15:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 2289 states have (on average 1.1782437745740497) internal successors, (2697), 2378 states have internal predecessors, (2697), 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-17 10:15:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 4363 transitions. [2025-03-17 10:15:44,831 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 4363 transitions. Word has length 133 [2025-03-17 10:15:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:44,832 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 4363 transitions. [2025-03-17 10:15:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 10:15:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 4363 transitions. [2025-03-17 10:15:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 10:15:44,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:44,833 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] [2025-03-17 10:15:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:15:44,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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-17 10:15:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1527727651, now seen corresponding path program 1 times [2025-03-17 10:15:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413939541] [2025-03-17 10:15:44,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 10:15:45,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 10:15:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:45,311 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-17 10:15:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:45,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413939541] [2025-03-17 10:15:45,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413939541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:45,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501927928] [2025-03-17 10:15:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:45,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:45,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:45,313 INFO L87 Difference]: Start difference. First operand 3530 states and 4363 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, (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-17 10:15:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:45,498 INFO L93 Difference]: Finished difference Result 3530 states and 4363 transitions. [2025-03-17 10:15:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:45,499 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, (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 144 [2025-03-17 10:15:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:45,510 INFO L225 Difference]: With dead ends: 3530 [2025-03-17 10:15:45,510 INFO L226 Difference]: Without dead ends: 3528 [2025-03-17 10:15:45,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:45,513 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 1228 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 2525 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-17 10:15:45,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 2525 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2025-03-17 10:15:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3528. [2025-03-17 10:15:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2288 states have (on average 1.1748251748251748) internal successors, (2688), 2376 states have internal predecessors, (2688), 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-17 10:15:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4354 transitions. [2025-03-17 10:15:45,735 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4354 transitions. Word has length 144 [2025-03-17 10:15:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:45,737 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 4354 transitions. [2025-03-17 10:15:45,737 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, (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-17 10:15:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4354 transitions. [2025-03-17 10:15:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 10:15:45,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:45,739 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] [2025-03-17 10:15:45,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:15:45,739 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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-17 10:15:45,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1122680309, now seen corresponding path program 1 times [2025-03-17 10:15:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:45,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568100686] [2025-03-17 10:15:45,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:46,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 10:15:46,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 10:15:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:46,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:46,170 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-17 10:15:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568100686] [2025-03-17 10:15:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568100686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:46,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098728976] [2025-03-17 10:15:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:46,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:46,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:46,171 INFO L87 Difference]: Start difference. First operand 3528 states and 4354 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:15:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:46,465 INFO L93 Difference]: Finished difference Result 3528 states and 4354 transitions. [2025-03-17 10:15:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-17 10:15:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:46,477 INFO L225 Difference]: With dead ends: 3528 [2025-03-17 10:15:46,477 INFO L226 Difference]: Without dead ends: 3526 [2025-03-17 10:15:46,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:46,478 INFO L435 NwaCegarLoop]: 1261 mSDtfsCounter, 1224 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2521 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-17 10:15:46,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2521 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2025-03-17 10:15:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3526. [2025-03-17 10:15:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 2287 states have (on average 1.1740271097507653) internal successors, (2685), 2374 states have internal predecessors, (2685), 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-17 10:15:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4351 transitions. [2025-03-17 10:15:46,813 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4351 transitions. Word has length 139 [2025-03-17 10:15:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:46,813 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 4351 transitions. [2025-03-17 10:15:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 10:15:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4351 transitions. [2025-03-17 10:15:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 10:15:46,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:46,816 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 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] [2025-03-17 10:15:46,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:15:46,816 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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-17 10:15:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash 840424247, now seen corresponding path program 1 times [2025-03-17 10:15:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785943218] [2025-03-17 10:15:46,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:47,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 10:15:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 10:15:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:47,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-17 10:15:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:47,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785943218] [2025-03-17 10:15:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785943218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:47,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:15:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916465390] [2025-03-17 10:15:47,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:47,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:15:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:47,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:15:47,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:47,384 INFO L87 Difference]: Start difference. First operand 3526 states and 4351 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-17 10:15:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:47,650 INFO L93 Difference]: Finished difference Result 3719 states and 4534 transitions. [2025-03-17 10:15:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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 152 [2025-03-17 10:15:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:47,661 INFO L225 Difference]: With dead ends: 3719 [2025-03-17 10:15:47,661 INFO L226 Difference]: Without dead ends: 3717 [2025-03-17 10:15:47,663 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-17 10:15:47,663 INFO L435 NwaCegarLoop]: 1293 mSDtfsCounter, 1101 mSDsluCounter, 2762 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 4055 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-17 10:15:47,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 4055 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-03-17 10:15:47,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3713. [2025-03-17 10:15:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 2423 states have (on average 1.167560874948411) internal successors, (2829), 2509 states have internal predecessors, (2829), 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-17 10:15:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 4523 transitions. [2025-03-17 10:15:47,872 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 4523 transitions. Word has length 152 [2025-03-17 10:15:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:47,873 INFO L471 AbstractCegarLoop]: Abstraction has 3713 states and 4523 transitions. [2025-03-17 10:15:47,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 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-17 10:15:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4523 transitions. [2025-03-17 10:15:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 10:15:47,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:47,875 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] [2025-03-17 10:15:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:15:47,875 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-17 10:15:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 680085215, now seen corresponding path program 2 times [2025-03-17 10:15:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:47,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767569792] [2025-03-17 10:15:47,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:15:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:48,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-17 10:15:48,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 152 statements. [2025-03-17 10:15:48,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 10:15:48,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:48,318 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-17 10:15:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:48,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767569792] [2025-03-17 10:15:48,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767569792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:48,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:48,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:15:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767491334] [2025-03-17 10:15:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:48,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:15:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:48,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:15:48,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:48,319 INFO L87 Difference]: Start difference. First operand 3713 states and 4523 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 10:15:52,333 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 [] [2025-03-17 10:15:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:52,645 INFO L93 Difference]: Finished difference Result 3719 states and 4526 transitions. [2025-03-17 10:15:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:15:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 152 [2025-03-17 10:15:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:52,656 INFO L225 Difference]: With dead ends: 3719 [2025-03-17 10:15:52,657 INFO L226 Difference]: Without dead ends: 3717 [2025-03-17 10:15:52,658 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-17 10:15:52,658 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 321 mSDsluCounter, 3733 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 5049 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-17 10:15:52,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 5049 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 10:15:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2025-03-17 10:15:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3713. [2025-03-17 10:15:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3713 states, 2423 states have (on average 1.1663227404044574) internal successors, (2826), 2509 states have internal predecessors, (2826), 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-17 10:15:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 4520 transitions. [2025-03-17 10:15:52,876 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 4520 transitions. Word has length 152 [2025-03-17 10:15:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 3713 states and 4520 transitions. [2025-03-17 10:15:52,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 10:15:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4520 transitions. [2025-03-17 10:15:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 10:15:52,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:52,879 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] [2025-03-17 10:15:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:15:52,879 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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-17 10:15:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -325877650, now seen corresponding path program 1 times [2025-03-17 10:15:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528702224] [2025-03-17 10:15:52,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:53,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 10:15:53,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 10:15:53,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:53,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:53,402 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-17 10:15:53,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:53,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528702224] [2025-03-17 10:15:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528702224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:15:53,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:15:53,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:15:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335448301] [2025-03-17 10:15:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:15:53,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:15:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:53,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:15:53,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:15:53,405 INFO L87 Difference]: Start difference. First operand 3713 states and 4520 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:15:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:15:53,624 INFO L93 Difference]: Finished difference Result 3713 states and 4520 transitions. [2025-03-17 10:15:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:15:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2025-03-17 10:15:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:15:53,638 INFO L225 Difference]: With dead ends: 3713 [2025-03-17 10:15:53,638 INFO L226 Difference]: Without dead ends: 3711 [2025-03-17 10:15:53,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:15:53,640 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 1219 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 2515 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-17 10:15:53,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 2515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 10:15:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2025-03-17 10:15:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3711. [2025-03-17 10:15:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3711 states, 2422 states have (on average 1.1655656482246077) internal successors, (2823), 2507 states have internal predecessors, (2823), 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-17 10:15:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 3711 states and 4517 transitions. [2025-03-17 10:15:53,882 INFO L78 Accepts]: Start accepts. Automaton has 3711 states and 4517 transitions. Word has length 145 [2025-03-17 10:15:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:15:53,883 INFO L471 AbstractCegarLoop]: Abstraction has 3711 states and 4517 transitions. [2025-03-17 10:15:53,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 10:15:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3711 states and 4517 transitions. [2025-03-17 10:15:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 10:15:53,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:15:53,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:15:53,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 10:15:53,886 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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-17 10:15:53,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:15:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1848094183, now seen corresponding path program 1 times [2025-03-17 10:15:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:15:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005848369] [2025-03-17 10:15:53,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:53,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:15:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 10:15:54,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 10:15:54,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:54,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-17 10:15:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:15:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005848369] [2025-03-17 10:15:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005848369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:15:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601788507] [2025-03-17 10:15:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:15:54,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:15:54,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:15:54,661 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-17 10:15:54,661 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-17 10:15:55,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 10:15:55,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 10:15:55,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:15:55,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:15:55,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 10:15:55,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:15:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 10:15:56,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:15:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-03-17 10:15:56,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601788507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:15:56,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:15:56,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2025-03-17 10:15:56,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47153931] [2025-03-17 10:15:56,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:15:56,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 10:15:56,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:15:56,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 10:15:56,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:15:56,783 INFO L87 Difference]: Start difference. First operand 3711 states and 4517 transitions. Second operand has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 13 states have internal predecessors, (118), 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-17 10:16:00,797 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 [] [2025-03-17 10:16:04,815 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 []